Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Anupam Chattopadhyay

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Laxmidhar Biswal

> Home > Persons > Anupam Chattopadhyay

Publications

2019
[i40]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1904-06920
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1904-06920
Laxmidhar Biswal, Debjyoti Bhattacharjee, Anupam Chattopadhyay, Hafizur Rahaman:
New techniques for fault-tolerant decomposition of Multi-Controlled Toffoli gate. CoRR abs/1904.06920 (2019)
2018
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/mj/BiswalDBCR18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mj/BiswalDBCR18
Laxmidhar Biswal, Rakesh Das, Chandan Bandyopadhyay, Anupam Chattopadhyay, Hafizur Rahaman:
A template-based technique for efficient Clifford+T-based quantum circuit implementation. Microelectron. J. 81: 58-68 (2018)
2016
[c69]
- view
  authority control:
- export record
  dblp key:
  - conf/ismvl/BiswalBCWDR16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ismvl/BiswalBCWDR16
Laxmidhar Biswal, Chandan Bandyopadhyay, Anupam Chattopadhyay, Robert Wille, Rolf Drechsler, Hafizur Rahaman:
Nearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation. ISMVL 2016: 156-161

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.