The DOI matches its Crossref record; 123 of the 123 references it cites were found in a registry or an index.
Synthesis and optimization of reversible circuits—a survey
Open accessAbstract
Reversible logic circuits have been historically motivated by theoretical research in low-power electronics as well as practical improvement of bit manipulation transforms in cryptography and computer graphics. Recently, reversible circuits have attracted interest as components of quantum algorithms, as well as in photonic and nano-computing technologies where some switching devices offer no signal gain. Research in generating reversible logic distinguishes between circuit synthesis, postsynthesis optimization, and technology mapping. In this survey, we review algorithmic paradigms—search based, cycle based, transformation based, and BDD based—as well as specific algorithms for reversible synthesis, both exact and heuristic. We conclude the survey by outlining key open challenges in synthesis of reversible and quantum logic, as well as most common misconceptions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Theory of Self-Reproducing Automata
Schwartz, J. T., von Neumann, J., & Burks, A. W. (1967) · Mathematics of Computation · doi:10.2307/2005041 · Cited by 5,422
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Principles and Practices of Interconnection Networks
Dally, W. J., & Towles, B. (2004) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,735
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Irreversibility and heat generation in the computing process
Landauer, R. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0261 · Cited by 2,585
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896 · cited 2×
“—A multiple-control Fredkin gate [Fredkin and Toffoli 1982] Fred(x1, x2, .”
BackgroundFeynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770
Toffoli, T. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_104 · Cited by 1,523
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Fredkin, E., & Toffoli, T. (2001) · Cited by 1,302
Scalable multiparticle entanglement of trapped ions
Häffner, H., Hänsel, W., Roos, C. F., Benhelm, J., Chek-al-kar, D., Chwalla, M., Körber, T., Rapol, U. D., Riebe, M., Schmidt, P. O., et al. (2005) · Nature · doi:10.1038/nature04279 · Cited by 1,253
Feynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023
Reversible logic and quantum computers
Peres, A. (1985) · Physical Review A · doi:10.1103/physreva.32.3266 · Cited by 892
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Jerrum, M., Sinclair, A., & Vigoda, E. (2004) · Journal of the ACM · doi:10.1145/1008731.1008738 · Cited by 792
Synthesis of quantum-logic circuits
Shende, V. V., Bullock, S. S., & Markov, I. L. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.855930 · Cited by 669
Self-citationClassical simulation of quantum many-body systems with a tree tensor network
Shi, Y.-Y., Duan, L.-M., & Vidal, G. (2006) · Physical Review A · doi:10.1103/physreva.74.022320 · Cited by 577
Synthesis of reversible logic circuits
Shende, V. V., Prasad, A. K., Markov, I. L., & Hayes, J. P. (2003) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2003.811448 · Cited by 568
Self-citationRevLib: An Online Resource for Reversible Functions and Reversible Circuits
Wille, R., Gro, D., Teuber, L., Dueck, G. W., & Drechsler, R. (2008) · 38th International Symposium on Multiple Valued Logic (ismvl 2008) · doi:10.1109/ismvl.2008.43 · Cited by 495
A transformation based algorithm for reversible logic synthesis
Miller, D. M., Maslov, D., & Dueck, G. W. (2003) · Proceedings of the 40th annual Design Automation Conference · doi:10.1145/775832.775915 · Cited by 493
Shor’s Quantum Factoring Algorithm on a Photonic Chip
Politi, A., Matthews, J. C. F., & O'Brien, J. L. (2009) · Science · doi:10.1126/science.1173731 · Cited by 477
Quantum Computation and Quantum Information.
Campbell, P. J., & Rosenthal, E. S. (2001) · Mathematics Magazine · Cited by 476
Geometric theory of nonlocal two-qubit operations
Zhang, J., Vala, J., Sastry, S., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.042313 · Cited by 415
Quantum automata and quantum grammars
Moore, C., & Crutchfield, J. P. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00191-1 · Cited by 406
Logic Synthesis and Verification Algorithms
(2002) · Kluwer Academic Publishers eBooks · doi:10.1007/b117060 · Cited by 388
An Algorithm for Synthesis of Reversible Logic Circuits
Gupta, P., Agrawal, A., & Jha, N. K. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2006.871622 · Cited by 379
Altepeter, J. B., Jeffrey, E. R., & Kwiat, P. G. (2005) · Advances In Atomic, Molecular, and Optical Physics · doi:10.1016/s1049-250x(05)52003-2 · Cited by 365
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344
A new quantum ripple-carry addition circuit
Cuccaro, S. A., Draper, T. G., Kutin, S. A., & Moulton, D. P. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0410184 · Cited by 344
On the CNOT -cost of TOFFOLI gates
Shende, V., & Markov, I. L. (2009) · Quantum Information and Computation · doi:10.26421/qic8.5-6-8 · Cited by 337
Self-citationBDD-based synthesis of reversible logic for large functions
Wille, R., & Drechsler, R. (2009) · Proceedings of the 46th Annual Design Automation Conference · doi:10.1145/1629911.1629984 · Cited by 323
Minimal universal two-qubit controlled-NOT-based circuits
Shende, V. V., Markov, I. L., & Bullock, S. S. (2004) · Physical Review A · doi:10.1103/physreva.69.062321 · Cited by 288
Self-citationLogic Synthesis and Verification Algorithms
(1996) · Springer eBooks · doi:10.1007/0-387-31005-3 · Cited by 288
Efficient networks for quantum factoring
Beckman, D., Chari, A. N., Devabhaktuni, S., & Preskill, J. (1996) · Physical Review A · doi:10.1103/physreva.54.1034 · Cited by 268
Hung, W. N. N., Song, X., Yang, G., Yang, J., & Perkowski, M. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.858352 · Cited by 261
Quantum Circuit Simplification and Level Compaction
Maslov, D., Dueck, G. W., Miller, D. M., & Negrevergne, C. (2008) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2007.911334 · Cited by 251
Toffoli network synthesis with templates
Maslov, D., Dueck, G. W., & Miller, D. M. (2005) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.847911 · Cited by 227
Synthesis of quantum circuits for linear nearest neighbor architectures
Saeedi, M., Wille, R., & Drechsler, R. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0201-2 · Cited by 212
Self-citationReversible Cascades With Minimal Garbage
Maslov, D., & Dueck, G. W. (2004) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2004.836735 · Cited by 212
Quantum addition circuits and unbounded fan-out
Takahashi, Y., Tani, S., & Kunihiro, N. (2010) · Quantum Information and Computation · doi:10.26421/qic10.9-10-12 · Cited by 211
Quantum circuits with uniformly controlled one-qubit gates
Bergholm, V., Vartiainen, J. J., Möttönen, M., & Salomaa, M. M. (2005) · Physical Review A · doi:10.1103/physreva.71.052330 · Cited by 210
Optimal synthesis of linear reversible circuits
Patel, K. N., Markov, I., & Hayes, J. (2008) · Quantum information & computation · doi:10.26421/qic8.3-4-4 · Cited by 208
Self-citationBenchmarking Quantum Control Methods on a 12-Qubit System
Negrevergne, C., Mahesh, T. S., Ryan, C. A., Ditty, M., Cyr-Racine, F., Power, W., Boulant, N., Havel, T., Cory, D. G., & Laflamme, R. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.170501 · Cited by 202
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Fowler, A. G., Devitt, S. J., & Hollenberg, L. C. L. (2004) · Quantum Information and Computation · doi:10.26421/qic4.4-1 · Cited by 194
A layered software architecture for quantum computing design tools
Svore, K. M., Aho, A. V., Cross, A. W., Chuang, I. L., & Markov, I. L. (2006) · Computer · doi:10.1109/mc.2006.4 · Cited by 189
Self-citationESOP-based Toffoli Gate Cascade Generation
Fazel, K., Thornton, M. A., & Rice, J. E. (2007) · 2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing · doi:10.1109/pacrim.2007.4313212 · Cited by 189
Techniques for the synthesis of reversible Toffoli networks
Maslov, D., Dueck, G. W., & Miller, D. M. (2007) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/1278349.1278355 · Cited by 187
Hydrogenic Spin Quantum Computing in Silicon: A Digital Approach
Skinner, A. J., Davenport, M. E., & Kane, B. E. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.087901 · Cited by 185
Fast quantum modular exponentiation
Van Meter, R., & Itoh, K. M. (2005) · Physical Review A · doi:10.1103/physreva.71.052320 · Cited by 181
Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques
Grosse, D., Wille, R., Dueck, G. W., & Drechsler, R. (2009) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2009.2017215 · Cited by 181
Synthesis of quantum logic circuits
Shende, V., Bullock, S. S., & Markov, I. L. (2005) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/1120725.1120847 · Cited by 174
Self-citationTransformation rules for designing CNOT-based quantum circuits
Iwama, K., Kambayashi, Y., & Yamashita, S. (2002) · Proceedings of the 39th conference on Design automation - DAC '02 · doi:10.1145/513918.514026 · Cited by 164
Reversible circuit synthesis using a cycle-based approach
Saeedi, M., Zamani, M. S., Sedighi, M., & Sasanian, Z. (2010) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1877745.1877747 · Cited by 154
Self-citationReversible computing and cellular automata—A survey
Morita, K. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.01.041 · Cited by 153
Principles of a reversible programming language
Yokoyama, T., Axelsen, H. B., & Glück, R. (2008) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/1366230.1366239 · Cited by 147
Constant-optimized quantum circuits for modular multiplication and exponentiation
Markov, I. L., & Saeedi, M. (2012) · Quantum Information and Computation · doi:10.26421/qic12.5-6-1 · Cited by 144
Self-citationDecompositions of general quantum gatesPreprint
Möttönen, M., & Vartiainen, J. J. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0504100 · Cited by 143
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Fowler, A. G., Devitt, S. J., & Hollenberg, L. C. L. (2004) · CERN Document Server (European Organization for Nuclear Research) · doi:10.5555/2011827.2011828 · Cited by 139
Improved quantum cost for n -bit Toffoli gates
Maslov, D. A., & Dueck, G. W. (2003) · Electronics Letters · doi:10.1049/el:20031202 · Cited by 137
Maslov, D. A., Falconer, S. M., & Mosca, M. (2008) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2008.917562 · Cited by 137
Logic synthesis of reversible wave cascades
Mishchenko, A., & Perkowski, M. A. (2002) · PDXScholar (Portland State University) · Cited by 136
A Family of Logical Fault Models for Reversible Circuits
Polian, I., Fiehn, T., Becker, B., & Hayes, J. P. (2005) · Proceedings - Asian Test Symposium/Proceedings · doi:10.1109/ats.2005.9 · Cited by 134
On the CNOT-cost of TOFFOLI gates
Shende, V., & Markov, I. L. (2009) · Quantum Information and Computation · doi:10.5555/2011791.2011799 · Cited by 127
Self-citationSynthesis of Fredkin-Toffoli reversible networks
Maslov, D., Dueck, G. W., & Miller, D. M. (2005) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2005.844284 · Cited by 127
A reversible carry-look-ahead adder using control gates
Desoete, B., & Vos, A. D. (2002) · Integration · doi:10.1016/s0167-9260(02)00051-2 · Cited by 117
A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis
Golubitsky, O., & Maslov, D. A. (2011) · IEEE Transactions on Computers · doi:10.1109/tc.2011.144 · Cited by 117
RevKit: A Toolkit for Reversible Circuit Design
Soeken, M., Frehse, S., Wille, R., & Drechsler, R. (2012) · Cited by 110
Discrete non-Abelian gauge theories in Josephson-junction arrays and quantum computation
Douçot, B., Ioffe, L. B., & Vidal, J. (2004) · Physical Review B · doi:10.1103/physrevb.69.214501 · Cited by 107
Data structures and algorithms for simplifying reversible circuits
Prasad, A. K., Shende, V., Markov, I. L., Hayes, J. P., & Patel, K. N. (2006) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1216396.1216399 · Cited by 106
Self-citationExperimental Realization of a Controlled-NOT Gate with Four-Photon Six-Qubit Cluster States
Gao, W.-B., Xu, P., Yao, X.-C., Gühne, O., Cabello, A., Lu, C., Peng, C.-Z., Chen, Z., & Pan, J.-W. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.020501 · Cited by 103
Checking equivalence of quantum circuits and states
Viamontes, G. F., Markov, I. L., & Hayes, J. P. (2007) · Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design · doi:10.1109/iccad.2007.4397246 · Cited by 102
Self-citationArchitectural implications of quantum computing technologies
Meter, R. V., & Oskin, M. (2006) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1126257.1126259 · Cited by 101
An efficient conversion of quantum circuits to a linear nearest neighbor architecture
Hirata, Y., Nakanishi, M., Yamashita, S., & Nakashima, Y. (2011) · Quantum Information and Computation · doi:10.26421/qic11.1-2-10 · Cited by 101
Maslov, D. A. (2007) · Physical Review A · doi:10.1103/physreva.76.052310 · Cited by 96
RevKit: An Open Source Toolkit for the Design of Reversible Circuits
Soeken, M., Frehse, S., Wille, R., & Drechsler, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29517-1_6 · Cited by 93
Recent progress in quantum algorithms
Bacon, D., & van Dam, W. (2010) · Communications of the ACM · doi:10.1145/1646353.1646375 · Cited by 92
Artificial Intelligence Search Algorithms
Korf, R. E. (2009) · Chapman & Hall/CRC applied algorithms and data structures series · doi:10.1201/9781584888215-c22 · Cited by 91
Reversible logic synthesis with Fredkin and Peres gates
Donald, J., & Jha, N. K. (2008) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1330521.1330523 · Cited by 89
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
Cheung, D., Maslov, D., Mathew, J., & Pradhan, D. K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89304-2_9 · Cited by 82
Equivalence Checking of Reversible Circuits
Wille, R., Grosse, D. J., Miller, D. M., & Drechsler, R. (2009) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2009.19 · Cited by 82
Generating the group of reversible logic gates
Vos, A. D., Raa, B., & Storme, L. (2002) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/35/33/307 · Cited by 81
Constant-optimized quantum circuits for modular multiplication and exponentiationPreprint
Markov, I. L., & Saeedi, M. (2012) · arXiv (Cornell University) · doi:10.5555/2230996.2230997 · Cited by 80
Self-citationA library-based synthesis methodology for reversible logic
Saeedi, M., Sedighi, M., & Zamani, M. S. (2010) · Microelectronics Journal · doi:10.1016/j.mejo.2010.02.002 · Cited by 73
Self-citationA novel synthesis algorithm for reversible circuits
Saeedi, M., Sedighi, M., & Zamani, M. S. (2007) · Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design · doi:10.1109/iccad.2007.4397245 · Cited by 72
Self-citationGroup theoretical aspects of reversible logic gates
Storme, L., Vos, A. D., & Jacobs, G. H. (1999) · Ghent University Academic Bibliography (Ghent University) · doi:10.3217/jucs-005-05-0307 · Cited by 69
Reducing Reversible Circuit Cost by Adding Lines
Miller, D. M., Wille, R., & Drechsler, R. (2010) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2010.48 · Cited by 69
Charge-Recovery Computing on Silicon
Kim, S., Ziesler, C. H., & Papaefthymiou, M. C. (2005) · IEEE Transactions on Computers · doi:10.1109/tc.2005.91 · Cited by 68
A fast quantum circuit for addition with few qubits
Takahashi, Y., & Kunihiro, N. (2008) · Quantum Information and Computation · doi:10.26421/qic8.6-7-5 · Cited by 68
Synthesis of the optimal 4-bit reversible circuits
Golubitsky, O., Falconer, S. M., & Maslov, D. (2010) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/1837274.1837440 · Cited by 65
Reducing the number of lines in reversible circuits
Wille, R., Soeken, M., & Drechsler, R. (2010) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/1837274.1837439 · Cited by 65
Block-based quantum-logic synthesis
Saeedi, M., Arabzadeh, M., Zamani, M. S., & Sedighi, M. (2011) · Quantum Information and Computation · doi:10.26421/qic11.3-4-6 · Cited by 62
Self-citationQuantum-error correction on linear-nearest-neighbor qubit arrays
Fowler, A. G., Hill, C. D., & Hollenberg, L. C. L. (2004) · Physical Review A · doi:10.1103/physreva.69.042314 · Cited by 61
Quantified Synthesis of Reversible Logic
Wille, R., Le, H. M., Dueck, G. W., & Grosse, D. J. (2008) · Design, Automation, and Test in Europe · doi:10.1145/1403375.1403620 · Cited by 54
SyReC: A Programming Language for Synthesis of Reversible Circuits
Wille, R., Offermann, S., & Drechsler, R. (2011) · Lecture notes in electrical engineering · doi:10.1007/978-1-4614-1427-8_13 · Cited by 52
Rule-based optimization of reversible circuitsPreprint
Arabzadeh, M., Saeedi, M., & Zamani, M. S. (2010) · arXiv (Cornell University) · doi:10.5555/1899721.1899916 · Cited by 50
Self-citationReversible Circuit Optimization Via Leaving the Boolean Domain
Maslov, D. A., & Saeedi, M. (2011) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2011.2105555 · Cited by 49
Self-citationShor's algorithm on a nearest-neighbor machine
Kutin, S. A. (2006) · arXiv · doi:10.48550/arxiv.quant-ph/0609001 · Cited by 47
Window optimization of reversible and quantum circuits
Soeken, M., Wille, R., Dueck, G. W., & Drechsler, R. (2010) · IEEE International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS) · doi:10.1109/ddecs.2010.5491754 · Cited by 42
Group Theory Based Synthesis of Binary Reversible Circuits
Yang, G., Song, X., Hung, W. N. N., Xie, F., & Perkowski, M. A. (2006) · Lecture notes in computer science · doi:10.1007/11750321_35 · Cited by 42
Saeedi, M., Zamani, M. S., & Sedighi, M. (2007) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi.2007.72 · Cited by 40
Self-citationMaslov, D., Falconer, S. M., & Mosca, M. (2007) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/1278480.1278717 · Cited by 39
On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
Choi, B.-S., & Meter, R. V. (2011) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2000502.2000504 · Cited by 38
Bi-Directional Synthesis of 4-Bit Reversible Circuits
Yang, G., Song, X., Hung, W. N. N., & Perkowski, M. A. (2007) · The Computer Journal · doi:10.1093/comjnl/bxm042 · Cited by 37
The quantum Fourier transform on a linear nearest neighbor architecture
Takahashi, Y., Kunihiro, N., & Ohta, K. (2007) · Quantum Information and Computation · doi:10.26421/qic7.4-7 · Cited by 37
Single Spin Measurement Using Cellular Automata Techniques
Pérez-Delgado, C. A., Mosca, M., Cappellaro, P., & Cory, D. G. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.100501 · Cited by 35
Using error correction to determine the noise model
Laforest, M., Simon, D., Boileau, J.-C., Baugh, J., Ditty, M. J. T., & Laflamme, R. (2007) · Physical Review A · doi:10.1103/physreva.75.012331 · Cited by 34
Faster quantum number factoring via circuit synthesis
Markov, I. L., & Saeedi, M. (2013) · Physical Review A · doi:10.1103/physreva.87.012310 · Cited by 33
Self-citationOn the effect of quantum interaction distance on quantum addition circuitsPreprint
Choi, B.-S., & Meter, R. V. (2011) · Cited by 25
An O(m 2 )-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2 m ) a
Maslov, D., Mathew, J., Cheung, D., & Pradhan, D. K. (2009) · Explore Bristol Research · doi:10.5555/2011814.2011818 · Cited by 24
Area-Efficient Multipliers Based on Multiple-Radix Representations
Dimitrov, V. S., Jarvinen, K. U., & Adikari, J. (2010) · IEEE Transactions on Computers · doi:10.1109/tc.2010.200 · Cited by 23
Xue, F., Du, J., Ming-Jun, S., Xian-Yi, Z., Han, R., & Wu, J. (2002) · Chinese Physics Letters · doi:10.1088/0256-307x/19/8/306 · Cited by 21
Block-based quantum-logic synthesisPreprint
Saeedi, M., Arabzadeh, M., Zamani, M. S., & Sedighi, M. (2011) · arXiv (Cornell University) · doi:10.5555/2011395.2011401 · Cited by 21
Self-citationVos, A. D. (2010) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2010.02.003 · Cited by 18
Improved Bounds for the Approximate QFTPreprint
Cheung, D. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0403071 · Cited by 16
Computation at a distancePreprint
Kutin, S., Moulton, D. P., & Smithline, L. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0701194 · Cited by 15
Fast equivalence-checking for quantum circuits
Yamashita, S., & Markov, I. L. (2010) · Quantum Information and Computation · doi:10.5555/2011464.2011465 · Cited by 10
Self-citationEffects of Interaction Distance on Quantum Addition CircuitsPreprint
Choi, B.-S., & Meter, R. V. (2008) · arXiv (Cornell University) · Cited by 6
Six Synthesis Methods for Reversible Logic
Rentergem, Y. V., Vos, A. D., & Keyser, K. D. (2007) · Open Systems & Information Dynamics · doi:10.1007/s11080-007-9032-8 · Cited by 5
New Structural Quantum Circuit Simulating a Toffoli GatePreprint
Asano, M., & Ishii, C. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0512016 · Cited by 2
Cited by
Limits on fundamental limits to computation
Markov, I. L. (2014) · Nature · doi:10.1038/nature13570 · Cited by 494
Self-citationThe Classification of Reversible Bit Operations
Aaronson, S., Grier, D., & Schaeffer, L. (2015) · arXiv · doi:10.48550/arxiv.1504.05155 · Cited by 33
“The notion of reversible computing [10, 28, 17, 7, 19, 23] arose from early work on the physics of computation, by such figures as Feynman, Bennett, Benioff, Landauer, Fredkin, Toffoli, and Lloyd.”
BackgroundImproved reversible and quantum circuits for Karatsuba-based integer multiplication
Parent, A., Roetteler, M., & Mosca, M. (2018) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.tqc.2017.7 · Cited by 24
Metadata
- Authors
- Saeedi, M., & Markov, I. L.
- Venue
- ACM Computing Surveys
- Published
- 2013-02
- Volume
- 45
- Issue
- 2
- Pages
- 1-34
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2114638353
- Cited by
- 298
- References
- 123
- FWCI
- 36.82
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.