Graph-based simulation of quantum computation in the density matrix representation

Quantum Information and Computation

Volumn 5, Issue 2, 2005, Pages 113-130

  Viamontes, George F ^a   Markov, Igor L ^a   Hayes, John P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Decision diagrams; Density matrices; Graph data structures; Quantum algorithms; Quantum circuits; Quantum errors; QuIDDs; Simulation

Indexed keywords

COMPUTATION THEORY; ERROR CORRECTION; GRAPH ALGORITHMS; GRAPH STRUCTURES; GRAPHIC METHODS; MATRIX ALGEBRA; QUANTUM COMPUTERS; QUANTUM THEORY; SIMULATORS;

DECISION DIAGRAM; DENSITY MATRIX; QUANTUM ALGORITHMS; QUANTUM CIRCUIT; QUANTUM ERROR; QUIDDS; SIMULATION;

QUANTUM EFFICIENCY;

EID: 16244414296     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. Start-up makes quantum leap in cryptography, CNET News.com, November 6, 2003.
2. M. A. Nielsen and I. L. Chuang (2000), Quantum Computation and Quantum Information, Cambridge Univ. Press.
3. L. Grover (1997), Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett., 79, pp. 325-328.
4. P. W. Shor (1997), Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. of Computing, 26, p. 1484.
5. D. Kielpinski, C. Monroe, and D. J. Wineland (2002), Architecture for a large-scale ion-trap quantum computer, Nature, 417, pp. 709-711.
6. C. Monroe (2002), Quantum information processing with atoms and photons, Nature, 416, pp. 238-246.
7. B. M. Boghosian and W. Taylor (1997), Simulating quantum mechanics on a quantum computer, quant-ph/9701019.
8. G. F. Viamontes, I. L. Markov, and J. P. Hayes (2003), Improving gate-level simulation of quantum circuits, Quantum Inf. Processing, Vol. 2, pp. 347-380.
9. G. F. Viamontes, M. Rajagopolan, I. L. Markov, and J. P. Hayes (2003), Gate-level simulation of quantum circuits, in Proc. of ACM/IEEE Asia and South-Pacific Design Automation Conf. (ASPDAC), pp. 295-301.
10. D. Greve, QDD: a quantum computer emulation library, http://thegreves. com/david/QDD/qdd.html.
11. P. E. Black et al., Quantum compiling and simulation, http://hissa.nist.gov/~black/Quantum/.
12. C.Y. Lee (1959), Representation of switching circuits by binary decision diagrams, Bell System Tech. J., 38, pp. 985-999.
13. R. Bryant (1986), Graph-based algorithms for Boolean function manipulation, IEEE Trans. on Computers, C35, pp. 677-691.
14. E. Clarke et al. (1996), Multi-terminal binary decision diagrams and hybrid decision diagrams, in T. Sasao and M. Fujita, eds, Representations of Discr. Functions, pp. 93-108, Kluwer.
15. R. I. Bahar et al. (1997), Algebraic decision diagrams and their applications, J. of Formal Methods in System Design, Vol. 10, No. 2/3.
16. K. M. Obenland and A. M. Despain (1998), A parallel quantum computer simulator, High Performance Computing.
17. D. Gottesman (1998), The Heisenberg representation of quantum computers, quant-ph/9807006.
18. S. Aaronson and D. Gottesman (2004), Improved Simulation of Stabilizer Circuits, to appear in Phys. Rev. A, quant-ph/0406196.
19. F. Somenzi (1998), CUDD: CU Decision Diagram Package, release 2.3.0, Univ. of Colorado at Boulder.
20. http://vlsicad.eecs.umich.edu/Quantum/qp/.
21. D. Maslov, G. Dueck, and N. Scott, Reversible logic synthesis benchmarks page, http://www.cs.uvic.ca/~dmaslov/.
22. A. M. Steane (1996), Error-correcting codes in quantum theory, Phys. Rev. Lett., 77, p. 793.
23. C. H. Bennett and G. Brassard (1984), Quantum cryptography: public key distribution and coin tossing, in Proc. of IEEE Intl. Conf. on Computers, Systems, and Signal Processing, pp. 175-179.