Synthesis of quantum logic circuits

Authors:
Vivek V. Shende;Stephen S. Bullock;Igor L. Markov
Affiliations:
The University of Michigan, Ann Arbor, MI;Natl. Inst. of Standards and Technology, Gaithersburg, MD;The University of Michigan, Ann Arbor, MI
Venue:
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Year:
2005

Citing 8
Cited 5

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Transformation rules for designing CNOT-based quantum circuits

Proceedings of the 39th annual Design Automation Conference
Quantum computation and quantum information

Quantum computation and quantum information
Reducing Quantum Computations to Elementary Unitary Operations

Computing in Science and Engineering
An arbitrary twoqubit computation In 23 elementary gates or less

Proceedings of the 40th annual Design Automation Conference
Smaller Two-Qubit Circuits for Quantum Communication and Computation

Proceedings of the conference on Design, automation and test in Europe - Volume 2
Quantum logic synthesis by symbolic reachability analysis

Proceedings of the 41st annual Design Automation Conference
Synthesis of reversible logic circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Analysis and synthesis of quantum circuits by using quantum decision diagrams

Proceedings of the conference on Design, automation and test in Europe: Proceedings
The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An XQDD-Based Verification Method for Quantum Circuits

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Block-based quantum-logic synthesis

Quantum Information & Computation
Efficient circuits for exact-universal computationwith qudits

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention of the EDA community [10, 17, 4, 16, 9]. We discuss efficient circuits to initialize quantum registers and implement generic quantum computations. Our techniques yield circuits that are twice as small as the best previously published technique. Moreover, a theoretical lower bound shows that our new circuits can be improved by at most a factor of two. Further, the circuits grow by at most a factor of nine under severe architectural restrictions.