The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization
Open accessAbstract
Various implementations of the Toffoli gate up to a relative phase have been known for years. The advantage over the regular Toffoli gate is its smaller circuit size. However, its use has been often limited to a demonstration of quantum control in designs such as those where the Toffoli gate is being applied last or otherwise for some specific reasons the relative phase does not matter. It was commonly believed that the relative-phase deviations would prevent the relative-phase Toffoli gates from being very helpful in practical large-scale designs. In this paper, we report three circuit identities that provide the means for replacing certain configurations of the multiple control Toffoli gates with their simpler relative-phase implementations, up to a selectable unitary on certain qubits, and without changing the overall functionality. We illustrate the advantage via applying those identities to the optimization of the known circuits implementing multiple control Toffoli gates, and report the reductions in the controlled-not count, $T$count, as well as the number of ancillae used. We suggest that a further study of the relative-phase Toffoli implementations and their use may yield other optimizations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The AND can be implemented with only 3 CNOTs using a relative phase Toffoli implementation [36], [54] given by Qiskit's Margolus gate RCCX and a consecutive S † .”
From High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices (2023) · cites this paper as [36]
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 20,450
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 · cited 1×
“We illustrate the advantage via applying those identities to the optimization of the known circuits implementing multiple control Toffoli gates, and report the reductions in the CNOT-count, T - count, as well as the number of ancillae used.”
MethodSuperconducting Circuits for Quantum Information: An Outlook
Devoret, M., & Schoelkopf, R. J. (2013) · Science · doi:10.1126/science.1231930 · Cited by 2,197 · cited 1×
“-level implementations, and fault-tolerant gates on the logical level. Given the limitations of the current quantum control even in the most promising and developed ions traps [7] and superconducting [4] quantum information processing approaches, coupled with an observation that even the smallest of non-linear (consid…”
BackgroundUniversal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 1×
“The known approaches employ state purification and gate teleportation as a means of generating the T gate, that can get quite costly in the realistic systems [3].”
BackgroundQuantum Computation with Ions in Thermal Motion
Sørensen, A. S., & Mølmer, K. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1971 · Cited by 1,088 · cited 1×
“Indeed, trapped ions with Molmer-Sorenson gate [10] operate in the weak coupling regime (two-qubit gates take roughly 20 fold effort to implement compared to arbitrary single-qubit gates), and Molmer-Sorenson gate itself is equivalent to the CNOT up to a conjugation by a pair of RZ(a) and RZ(−a) gates on both qubits,…”
MethodScaling the Ion Trap Quantum Processor
Monroe, C., & Kim, J. (2013) · Science · doi:10.1126/science.1231298 · Cited by 786 · cited 1×
“sformations for physical-level implementations, and fault-tolerant gates on the logical level. Given the limitations of the current quantum control even in the most promising and developed ions traps [7] and superconducting [4] quantum information processing approaches, coupled with an observation that even the smalle…”
BackgroundPolynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
Amy, M., Maslov, D. A., & Mosca, M. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2341953 · Cited by 319 · cited 9×
“We can furthermore explain how to obtain the solution with 12k − 20 T gates to implement a kcontrolled Toffoli gate using k−2 unrestricted ancilla featured in [1] without resorting to a computer optimization.”
BackgroundMethodInfluentialSelf-citationQuantum circuits of T-depth one
Selinger, P. (2012) · arXiv.org · doi:10.1103/physreva.87.042302 · Cited by 252 · cited 10×
“b • • c Z H T T † T T † H Figure 2: Toffoli gate implemented up to a relative phase: gates 1-10 implement a type-{c} special relative phase Toffoli gate, known as the controlled-controlled-iX in [12], whereas circuit with gates 2-10 implements some generic relative phase Toffoli gate.”
BackgroundMethodInfluentialQuantum Circuit Simplification and Level Compaction
Maslov, D. A., 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 248 · cited 4×
“The optimization in [6] is motivated by a computational model where the two-qubit interaction given by diag{I,X±t}, where t ∈ R[0, 1] and X is Pauli-X , is tunable and parametrized by time.”
BackgroundMethodInfluentialSelf-citation
Research works printed but not linked: 3
- A. M. Childs, 2003, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing STOC '03
- G. Song, 2004, Quantum Inf. Comput., 4, 361
- V. V. Shende, 2009, Quantum Inf. Comput., 9, 461
Cited by
Sorted by citations
Toward the first quantum simulation with quantum speedup
Childs, A. M., Maslov, D., Nam, Y., Ross, N. J., & Su, Y. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1801723115 · Cited by 551
“The reflection about |0〉 is implemented as a multiply-controlled Z gate, following the construction in [55] that uses ancillas in the state |0〉.”
BackgroundMethodInfluentialSelf-citationApplying Grover’s Algorithm to AES: Quantum Resource Estimates
Grassl, M., Langenberg, B., Roetteler, M., & Steinwandt, R. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-29360-8_3 · Cited by 299
Quantum Computer Systems for Scientific Discovery
Alexeev, Y., Bacon, D., Brown, K. R., Calderbank, R., Carr, L. D., Chong, F. T., DeMarco, B., Englund, D. R., Farhi, E., Fefferman, B., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.017001 · Cited by 339
“125,126], multiple-control gates [127,128], libraries for integer arithmetic and finite fields, and many domain-”
BackgroundSelf-citationQuantum Computer Systems for Scientific Discovery
Alexeev, Y., Bacon, D., Brown, K. R., Calderbank, R., Carr, L. D., Chong, F. T., DeMarco, B., Englund, D., Farhi, E., Fefferman, B., et al. (2021) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.6082/h7fqg-6vt65 · Cited by 257
Self-citationAccelerated Variational Quantum Eigensolver
Wang, D., Higgott, O., & Brierley, S. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.140504 · Cited by 241
Complete 3-Qubit Grover search on a programmable quantum computer
Figgatt, C., Maslov, D. A., Landsman, K. A., Linke, N. M., Debnath, S., & Monroe, C. R. (2017) · Nature Communications · doi:10.1038/s41467-017-01904-7 · Cited by 250
Self-citationAutomated optimization of large quantum circuits with continuous parameters
Nam, Y., Ross, N. J., Su, Y., Childs, A. M., & Maslov, D. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0072-4 · Cited by 274
Self-citationCredit Risk Analysis Using Quantum Computers
Egger, D. J., Gutiérrez, R. G., Mestre, J. C., & Woerner, S. (2020) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3038063 · Cited by 174
“[31] Dmitri Maslov, “On the advantages of using relative phase toffolis with an application to multiple control toffoli optimization,” Phys.”
BackgroundMethodBasic circuit compilation techniques for an ion-trap quantum machine
Maslov, D. A. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa5e47 · Cited by 122
Self-citationTowards Large-scale Functional Verification of Universal Quantum Circuits
Amy, M. (2019) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.287.1 · Cited by 121
Advanced Equivalence Checking for Quantum Circuits
Burgholzer, L., & Wille, R. (2020) · Springer eBooks · doi:10.1007/978-3-032-06770-8_14 · Cited by 112
High-fidelity three-qubit iToffoli gate for fixed-frequency superconducting qubits
Kim, Y., Morvan, A., Nguyen, L. B., Naik, R., Jünger, C., Chen, L., Kreikebaum, J. M., Santiago, D., & Siddiqi, I. A. (2022) · Nature Physics · doi:10.1038/s41567-022-01590-3 · Cited by 111
Quantum computing for neutrino-nucleus scattering
Roggero, A., Li, A. C. Y., Carlson, J., Gupta, R., & Perdue, G. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.074038 · Cited by 103
Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity
He, Y., Luo, M.-X., Zhang, E., Wang, H.-K., & Wang, X. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3389-4 · Cited by 104
Distributed Quantum Computing and Network Control for Accelerated VQE
DiAdamo, S., Ghibaudi, M., & Cruise, J. R. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3057908 · Cited by 84
Demonstration of Shor’s factoring algorithm for N $$=$$ 21 on IBM quantum processors
Skosana, U., & Tame, M. (2021) · Scientific Reports · doi:10.1038/s41598-021-95973-w · Cited by 79
Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation
Sato, Y., Kondo, R., Koide, S., Takamatsu, H., & Imoto, N. (2021) · Physical Review A · doi:10.1103/physreva.104.052409 · Cited by 67
Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow
Burgholzer, L., Raymond, R., & Wille, R. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00051 · Cited by 64
Ancilla-input and garbage-output optimized design of a reversible quantum integer multiplier
Jayashree, H. V., Thapliyal, H., Arabnia, H. R., & Agrawal, V. K. (2016) · The Journal of Supercomputing · doi:10.1007/s11227-016-1676-0 · Cited by 59
Scalable algorithm simplification using quantum AND logic
Chu, J., He, X., Zhou, Y., Yuan, J., Zhang, L., Guo, Q., Hai, Y.-J., Han, Z., Hu, C.-K., Huang, W., et al. (2022) · Nature Physics · doi:10.1038/s41567-022-01813-7 · Cited by 57
Use of global interactions in efficient quantum circuit constructions
Maslov, D., & Nam, Y. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aaa398 · Cited by 59
Self-citationBest Approximate Quantum Compiling Problems
Madden, L., & Simonetto, A. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3505181 · Cited by 68
T-Count Optimization and Reed–Muller Codes
Amy, M., & Mosca, M. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2906374 · Cited by 49
Quantum Circuits for Sparse Isometries
Malvetti, E., Iten, R., & Colbeck, R. (2021) · Quantum · doi:10.22331/q-2021-03-15-412 · Cited by 48
“Note that if k ≥ 5 this bound can be reduced to 8k − 12 [15].”
BackgroundEquivalence Checking of Quantum Circuits With the ZX-Calculus
Peham, T., Burgholzer, L., & Wille, R. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3202204 · Cited by 65
“Since quantum computers typically only support a limited gate-set, every high-level operation has to be decomposed into that gate-set [36], [37], [38].”
BackgroundMeasurement-Free Fault-Tolerant Quantum Error Correction in Near-Term Devices
Heußen, S., Locher, D. F., & Müller, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010333 · Cited by 53
Programming quantum computers using design automation
Soeken, M., Häner, T., & Roetteler, M. (2018) · Design, Automation, and Test in Europe · doi:10.23919/date.2018.8341993 · Cited by 49
Implementation of efficient quantum search algorithms on NISQ computers
Zhang, K., Rao, P., Yu, K., Lim, H., & Korepin, V. E. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03165-2 · Cited by 49
A quantum algorithm for string matching
Niroula, P., & Nam, Y. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00369-3 · Cited by 42
MQT QMAP: Efficient Quantum Circuit Mapping
Wille, R., & Burgholzer, L. (2023) · Proceedings of the 2023 International Symposium on Physical Design · doi:10.1145/3569052.3578928 · Cited by 41
Constrained optimization via quantum Zeno dynamics
Herman, D., Shaydulin, R., Sun, Y., Chakrabarti, S., Hu, S., Minssen, P., Rattew, A. G., Yalovetzky, R., & Pistoia, M. (2023) · Communications Physics · doi:10.1038/s42005-023-01331-9 · Cited by 43
Design automation and design space exploration for quantum computers
Soeken, M., Roetteler, M., Wiebe, N., & Micheli, G. D. (2017) · Design, Automation, and Test in Europe · doi:10.23919/date.2017.7927035 · Cited by 43
LUT-Based Hierarchical Reversible Logic Synthesis
Soeken, M., Roetteler, M., Wiebe, N., & Micheli, G. D. (2018) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2018.2859251 · Cited by 61
Logic Synthesis for Established and Emerging Computing
Testa, E., Soeken, M., Amar, L. G., & Micheli, G. D. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2869760 · Cited by 40
Ding, Y., Wu, X.-C., Holmes, A., Wiseth, A., Franklin, D., Martonosi, M., & Chong, F. T. (2020) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca45697.2020.00054 · Cited by 54
Better-than-classical Grover search via quantum error detection and suppression
Pokharel, B., & Lidar, D. A. (2024) · npj Quantum Information · doi:10.1038/s41534-023-00794-6 · Cited by 49
Gachechiladze, M., Gühne, O., & Miyake, A. (2019) · Physical Review A · doi:10.1103/physreva.99.052304 · Cited by 35
Estimating Quantum Speedups for Lattice Sieves
Albrecht, M. R., Gheorghiu, V., Postlethwaite, E. W., & Schanck, J. M. (2020) · International Conference on the Theory and Application of Cryptology and Information Security · doi:10.1007/978-3-030-64834-3_20 · Cited by 58
Constructing quantum circuits with global gates
van de Wetering, J. (2021) · New Journal of Physics · doi:10.1088/1367-2630/abf1b3 · Cited by 44
“Using the Toffoli construction of [27] which requires more ancillae uses just 6n − 12 CNOT gates and 8n − 17 T gates, which brings the counts closer.”
MethodQuantum pricing with a smile: implementation of local volatility model on quantum computer
Kaneko, K., Miyamoto, K., Takeda, N., & Yoshino, K. (2020) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00125-2 · Cited by 49
“CAD 33(10), 1476 (2014) [48] D.”
MethodInfluentialQuantum Circuits for Sparse Isometries
Malvetti, E., Iten, R., & Colbeck, R. (2021) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · doi:10.3929/ethz-b-000480339 · Cited by 36
Grover search revisited: Application to image pattern matching
Tezuka, H., Nakaji, K., Satoh, T., & Yamamoto, N. (2022) · Physical Review A · doi:10.1103/physreva.105.032440 · Cited by 43
Characterizing Grover search algorithm on large-scale superconducting quantum computers
AbuGhanem, M. (2025) · Scientific Reports · doi:10.1038/s41598-024-80188-6 · Cited by 42
The circuit design and optimization of quantum multiplier and divider
Li, H.-S., Fan, P., Xia, H., & Long, G. (2022) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1874-2 · Cited by 29
Linear and Logarithmic Time Compositions of Quantum Many-Body Operators
Motzoi, F., Kaicher, M., & Wilhelm, F. K. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.160503 · Cited by 29
Wang, Q., Li, M., Monroe, C. R., & Nam, Y. (2021) · Quantum · doi:10.22331/q-2021-07-26-509 · Cited by 27
CNOT-Efficient Circuits for Arbitrary Rank Many-Body Fermionic and Qubit Excitations
Magoulas, I., & Evangelista, F. A. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c01016 · Cited by 32
Colloquium : Qudits for decomposing multiqubit gates and realizing quantum algorithms
Kiktenko, E. O., Nikolaeva, A. S., & Fedorov, A. K. (2025) · Reviews of Modern Physics · doi:10.1103/revmodphys.97.021003 · Cited by 31
Xor-And-Inverter Graphs for Quantum Compilation
Meuli, G., Soeken, M., & Micheli, G. D. (2022) · npj Quantum Information · doi:10.1038/s41534-021-00514-y · Cited by 27
Subdivided Phase Oracle for NISQ Search Algorithms
Satoh, T., Ohkura, Y., & Meter, R. V. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3012068 · Cited by 27
Limiting the Search Space in Optimal Quantum Circuit Mapping
Burgholzer, L., Schneider, S., & Wille, R. (2022) · Springer eBooks · doi:10.1007/978-3-032-06770-8_11 · Cited by 28
Kaneko, K., Miyamoto, K., Takeda, N., & Yoshino, K. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03127-8 · Cited by 24
Variational Quantum-Based Simulation of Waveguide Modes
Ewe, W.-B., Koh, D. E., Goh, S. T., Chu, H., & Png, C. E. (2022) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2022.3151510 · Cited by 31
Circuit Decomposition of Multicontrolled Special Unitary Single-Qubit Gates
Vale, R. F., Azevedo, T. M. D., Araújo, I. C. S., Araujo, I. F., & da Silva, A. J. (2023) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2023.3327102 · Cited by 55
One-step implementation of Toffoli gate for neutral atoms based on unconventional Rydberg pumping
Yin, H.-D., Li, X., Wang, G., & Shao, X. (2020) · Optics Express · doi:10.1364/oe.410158 · Cited by 23
Decision Diagrams for Quantum Computing
Wille, R., Hillmich, S., & Burgholzer, L. (2022) · Springer eBooks · doi:10.1007/978-3-031-15699-1_1 · Cited by 24
Cruz, P. M. Q., & Murta, B. (2024) · APL Quantum · doi:10.1063/5.0187026 · Cited by 22
Hierarchical Reversible Logic Synthesis Using LUTs
Soeken, M., Roetteler, M., Wiebe, N., & Micheli, G. D. (2017) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3061639.3062261 · Cited by 22
Efficient variational synthesis of quantum circuits with coherent multi-start optimization
Nemkov, N. A., Kiktenko, E. O., Luchnikov, I. A., & Fedorov, A. K. (2023) · Quantum · doi:10.22331/q-2023-05-04-993 · Cited by 27
“By definition [45], U is a relative phase Toffoli gate if U = V D, where V is the unitary matrix of the Toffoli gate and D is a diagonal unitary matrix.”
BackgroundImprovements to Quantum Search Techniques for Block-Ciphers, with Applications to AES
Davenport, J. H., & Pring, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81652-0_14 · Cited by 21
Advances in Quantum Computation and Quantum Technologies: A Design Automation Perspective
Micheli, G. D., Jiang, J.-H. R., Rand, R. W., Smith, K. N., & Soeken, M. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3205174 · Cited by 23
Fault-tolerant measurement-free quantum error correction with multiqubit gates
Perlin, M. A., Premakumar, V. N., Wang, J., Saffman, M. E., & Joynt, R. (2023) · Physical Review A · doi:10.1103/physreva.108.062426 · Cited by 20
Quantum search on noisy intermediate-scale quantum devices
Zhang, K., Yu, K., & Korepin, V. (2022) · Europhysics letters · doi:10.1209/0295-5075/ac90e6 · Cited by 27
Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem
Sano, Y., Norimoto, M., & Ishikawa, N. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3293452 · Cited by 21
Quantum Bilinear Interpolation Algorithms Based on Geometric Centers
Li, H.-S., Quan, J., Song, S.-X., Wei, Y., & Qing, L. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3591364 · Cited by 4
Synthetiq: Fast and Versatile Quantum Circuit Synthesis
Paradis, A., Dekoninck, J., Bichsel, B., & Vechev, M. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3649813 · Cited by 26
Partial Equivalence Checking of Quantum Circuits
Chen, T.-F., Jiang, J.-H. R., & Hsieh, M.-H. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00082 · Cited by 17
Sano, Y., Mitarai, K., Yamamoto, N., & Ishikawa, N. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3393437 · Cited by 17
Efficient implementation of multicontrolled quantum gates
Zindorf, B., & Bose, S. (2025) · Physical Review Applied · doi:10.1103/8blx-nfcr · Cited by 17
Evaluating ESOP Optimization Methods in Quantum Compilation Flows
Meuli, G., Schmitt, B., Ehlers, R., Riener, H., & Micheli, G. D. (2019) · International Workshop on Reversible Computation · doi:10.1007/978-3-030-21500-2_12 · Cited by 19
A SAT Encoding for Optimal Clifford Circuit Synthesis
Schneider, S., Burgholzer, L., & Wille, R. (2023) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3566097.3567929 · Cited by 17
Boolean satisfiability in quantum compilation
Soeken, M., Meuli, G., Schmitt, B. D. O., Mozafari, F., Riener, H., & Micheli, G. D. (2019) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2019.0161 · Cited by 16
Logic Synthesis for Quantum ComputingPreprint
Soeken, M., Roetteler, M., Wiebe, N., & Micheli, G. D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.02721 · Cited by 17
Efficient Constructions for Simulating Multi Controlled Quantum Gates
Balauca, S., & Arusoaie, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08760-8_16 · Cited by 17
Equivalence checking paradigms in quantum circuit design
Peham, T., Burgholzer, L., & Wille, R. (2022) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3489517.3530480 · Cited by 18
“Since quantum computers typically only support a limited gate set, every high-level operation has to be decomposed into that gate set [31]–[33].”
BackgroundConstructing All Qutrit Controlled Clifford+T gates in Clifford+T
Yeh, L., & van de Wetering, J. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-09005-9_3
Application of Permutation Group Theory in Reversible Logic Synthesis
Zakablukov, D. V. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-40578-0_17 · Cited by 16
Improved FRQI on superconducting processors and its restrictions in the NISQ era
Geng, A., Moghiseh, A., Redenbach, C., & Schladitz, K. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03838-0 · Cited by 15
“11 Box plots for relative difference between input image [10, 85, 170, 255] and output image from five different backends using the MARY-implementation.”
BackgroundMethodInfluentialVariational Quantum Shot-Based Simulations for Waveguide Modes
Colella, E., Beloin, S., Bastianelli, L., Primiani, V. M., Moglie, F., & Gradoni, G. (2023) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2023.3339243 · Cited by 15
Compiling Permutations for Superconducting QPUs
Soeken, M., Mozafari, F., Schmitt, B. D. O., & Micheli, G. D. (2019) · Design, Automation, and Test in Europe · doi:10.23919/date.2019.8715275 · Cited by 15
“Finally, each remaining multiple-controlled Toffoli gate is decomposed into a Clifford+T circuit as described in [19].”
MethodOonishi, K., Tanaka, T., Uno, S., Satoh, T., Meter, R. V., & Kunihiro, N. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3136195 · Cited by 18
High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
Pelofske, E., Bärtschi, A., Golden, J., & Eidenbenz, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00064 · Cited by 15
Riener, H., Ehlers, R., Schmitt, B. D. O., & Micheli, G. D. (2019) · Springer eBooks · doi:10.1007/978-3-030-20323-8_8 · Cited by 15
Simulating lattice quantum electrodynamics on a quantum computer
Kan, A., & Nam, Y. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/aca0b8 · Cited by 13
Implementing the Grover algorithm in homomorphic encryption schemes
Fernández, P., & Martin-Delgado, M. A. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043109 · Cited by 13
Reversible Pebble Games for Reducing Qubits in Hierarchical Quantum Circuit Synthesis
Bhattacharjee, D., Soeken, M., Dutta, S., Chattopadhyay, A., & Micheli, G. D. (2019) · IEEE International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2019.00026 · Cited by 10
Liu, H.-T., Chen, B., Zhang, J., Xiao, Y.-X., Li, T., Huang, K., Wang, Z., Li, H., Zhao, K., Xu, Y., et al. (2025) · Physical Review Letters · doi:10.1103/lvb9-pfr3 · Cited by 12
Quantum circuits for SU(3) lattice gauge theory
Balaji, P., Conefrey-Shinozaki, C., Draper, P., Elhaderi, J. K., Gupta, D., Hidalgo, L., Lytle, A., & Rinaldi, E. (2025) · Physical review. D/Physical review. D. · doi:10.1103/k8f6-yft8 · Cited by 12
Uncomputation in the Qrisp High-Level Quantum Programming Framework
Seidel, R., Tcholtchev, N., Bock, S., & Hauswirth, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38100-3_11 · Cited by 12
Finding Solutions to the Integer Case Constraint Satisfiability Problem Using Grover’s Algorithm
Vinod, G. M., & Shaji, A. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3120449 · Cited by 12
Applying Grover's algorithm to AES: quantum resource estimatesPreprint
Grassl, M., Langenberg, B., Roetteler, M., & Steinwandt, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.04965 · Cited by 12
Handling Non-unitaries in Quantum Circuit Equivalence Checking
Burgholzer, L., & Wille, R. (2022) · Springer eBooks · doi:10.1007/978-3-032-06770-8_18 · Cited by 16
Linear-Scaling Quantum Circuits for Computational Chemistry
Magoulas, I., & Evangelista, F. A. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00376 · Cited by 12
Improved NCV Gate Realization of Arbitrary Size Toffoli Gates
Kole, A., & Datta, K. (2017) · International Conference on VLSI Design · doi:10.1109/vlsid.2017.11 · Cited by 11
“Realizing the operation of a Toffoli gate using Clifford+T gate library has been reported in [10].”
MethodSignal processing techniques for efficient compilation of controlled rotations in trapped ions
Groenland, K., Witteveen, F., Schoutens, K., & Gerritsma, R. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab8830 · Cited by 15
The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
Yuan, C., & Carbin, M. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3656397 · Cited by 10
A Quantum Algorithm for System Specifications Verification
Zidan, M., Eisa, A. M., Qasymeh, M., & Shoman, M. A. I. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3383034 · Cited by 10
Automatic Uniform Quantum State Preparation Using Decision Diagrams
Mozafari, F., Soeken, M., Riener, H., & Micheli, G. D. (2020) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl49045.2020.00-10 · Cited by 10
Meuli, G., Soeken, M., Roetteler, M., Wiebe, N., & Micheli, G. D. (2018) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2018.8297398 · Cited by 10
Linear and Non-linear Relational Analyses for Quantum Program Optimization
Amy, M., & Lunderville, J. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3704873 · Cited by 17
Metadata
- Authors
- Maslov, D.
- Affiliations
- U.S. National Science Foundation (US)
- Corresponding author
- Maslov, Dmitri
- ORCID
- Maslov, Dmitri
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2016-02-10
- Volume
- 93
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W1749786511
- Cited by
- 193
- References
- 11
- Citations by year
- 2026: 17 · 2025: 19 · 2024: 28 · 2023: 23 · 2022: 30 · 2021: 23 · 2020: 17 · 2019: 12 · 2018: 8 · 2017: 10 · 2016: 5
- FWCI
- 9.61
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Quantum-Dot Cellular Automata
- Keywords
- quantum circuit synthesis
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
