Efficient quantum circuits for diagonal unitaries without ancillas
Open accessThe DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Efficient circuits have been demonstrated in some cases but generally require ancilla registers, which can dominate the qubit resources. In this paper, we give a simple way to construct efficient circuits for diagonal unitaries without ancillas, using a correspondence between Walsh functions and a basis for diagonal operators. This correspondence reduces the problem of constructing the minimal-depth circuit within a given error tolerance, for an arbitrary diagonal unitary in the basis, to that of finding the minimal-length Walsh-series approximation to the function f ( x ). We apply this approach to the quantum simulation of the classical Eckart barrier problem of quantum chemistry, demonstrating that high-fidelity quantum simulations can be achieved with few qubits and low depth.
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
Figures








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.
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?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The Hamiltonian variational approach is inspired by both adiabatic state preparation (ASP) and the quantum approximate optimization algorithm (QAOA) 331,332 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [332]
Experimental — accuracy not yet measured
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: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
The Penetration of a Potential Barrier by Electrons
Eckart, C. (1930) · Physical Review · doi:10.1103/physrev.35.1303 · Cited by 2,454
On the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
A Closed Set of Normal Orthogonal Functions
Walsh, J. L. (1923) · American Journal of Mathematics · doi:10.2307/2387224 · Cited by 967
Quantum Algorithms for Quantum Field Theories
Jordan, S. P., Lee, K. S. M., & Preskill, J. (2012) · Science · doi:10.1126/science.1217069 · Cited by 517
Tung, W.-K. (1985) · WORLD SCIENTIFIC eBooks · doi:10.1142/0097 · Cited by 494
Simulating quantum systems on a quantum computer
Zalka, C. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0162 · Cited by 390
Polynomial-time quantum algorithm for the simulation of chemical dynamics
Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M., & Aspuru-Guzik, A. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0808245105 · Cited by 385
Self-citationGeneral theory of higher-order decomposition of exponential operators and symplectic integrators
Suzuki, M. (1992) · Physics Letters A · doi:10.1016/0375-9601(92)90335-j · Cited by 244
Research works printed but not linked: 2
- Golubov B I, 1991, Mathematics and its Applications (Soviet series), 50
- Beauchamp K G, 1984, Applications of Walsh and Related Functions With an Introduction to Sequency Theory
Cited by
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Self-citationQuantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Self-citationQuantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J., Degroote, M., Johnson, P., Kieferová, M., Kivlichan, I., Menke, T., Peropadre, B., Sawaya, N., et al. (n.d.) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 1,265
Self-citationHybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
McClean, J. R., Kimchi-Schwartz, M. E., Carter, J., & de Jong, W. A. (2017) · Physical Review A · doi:10.1103/physreva.95.042308 · Cited by 516
Variational fast forwarding for quantum simulation beyond the coherence time
Cîrstoiu, C., Holmes, Z., Iosue, J., Cincio, L., Coles, P. J., & Sornborger, A. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00302-0 · Cited by 232
Metadata
- Authors
- Welch, J., Greenbaum, D., Mostame, S., & Aspuru-Guzik, A.
- Affiliations
- Harvard University (US)
- MIT Lincoln Laboratory (US)
- Corresponding author
- Welch, Jonathan
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2014-03-31
- Volume
- 16
- Issue
- 3
- Pages
- 033040
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2152620223
- Cited by
- 114
- References
- 18
- Citations by year
- 2026: 12 · 2025: 28 · 2024: 18 · 2023: 15 · 2022: 10 · 2021: 3 · 2020: 8 · 2019: 5 · 2018: 1 · 2017: 3 · 2016: 6 · 2015: 1 · 2014: 4
- FWCI
- 4.65
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- creativecommons.org/licenses/by/3.0/ (vor)
- Locations
- New Journal of Physics (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (FA8721-05-C-0002, 1037992)
- U.S. Department of Defense (FA8721-05-C-0002, FA9550)
- Division of Chemistry
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum circuit construction, Walsh functions, quantum simulation, quantum chemistry, Grover's algorithm
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient quantum circuits for diagonal unitaries without ancillas. https://app.cochat.ai/papers/10.1088/1367-2630/16/3/033040
- The paper
- Welch, J., Greenbaum, D., Mostame, S., & Aspuru-Guzik, A. (2014). Efficient quantum circuits for diagonal unitaries without ancillas. New Journal of Physics. https://doi.org/10.1088/1367-2630/16/3/033040
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.