Quantum logic synthesis by symbolic reachability analysis
- 7 June 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 838-841
- https://doi.org/10.1145/996566.996790
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Segmented channel routability via satisfiabilityACM Transactions on Design Automation of Electronic Systems, 2004
- A transformation based algorithm for reversible logic synthesisPublished by Association for Computing Machinery (ACM) ,2003
- BDD minimization by scatter searchIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2002
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonanceNature, 2001
- Five two-bit quantum gates are sufficient to implement the quantum Fredkin gatePhysical Review A, 1996
- Elementary gates for quantum computationPhysical Review A, 1995
- Realizable Universal Quantum Logic GatesPhysical Review Letters, 1995
- Quantum computational networksProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1989
- Reversible logic and quantum computersPhysical Review A, 1985
- Conservative logicInternational Journal of Theoretical Physics, 1982