CoChat

Efficient quantum circuits for diagonal unitaries without ancillas

Open access
Welch, Jonathan, Greenbaum, Daniel, Mostame, Sarah, Aspuru-Guzik, Alan · 2014 · New Journal of Physics

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/1367-2630/16/3/033040

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 First eight Walsh functions, in Paley order. Rademacher functions are in red.
Figure 1 First eight Walsh functions, in Paley order. Rademacher functions are in red.CC-BY · From the PDF
Figure 2 ˆ = ⊗ ⊗ w Z Z 1 6 .
Figure 2 ˆ = ⊗ ⊗ w Z Z 1 6 .CC-BY · From the PDF
Figure 3 For n = 3 qubits, equivalent circuits for implementing the operator ˆ = ⊗ ⊗ ( ) ( ) U ia Z Z Z exp 7 7 in (7). We use the compact notation ≡ -( ) R R a 2 j z j . We follow the convention in (b) where the CNOTs are always targeted on the highest order qubit possible.
Figure 3 For n = 3 qubits, equivalent circuits for implementing the operator ˆ = ⊗ ⊗ ( ) ( ) U ia Z Z Z exp 7 7 in (7). We use the compact notation ≡ -( ) R R a 2 j z j . We follow the convention in (b) where the CNOTs are always targeted on the highest order qubit possible.CC-BY · From the PDF
Figure 4 Non-optimal circuit implementing the Paley-ordered Walsh operators ˆ w 1 through ˆ w 7 . Dashed lines separate the sub circuits for each of the individual Walsh functions. The rotation gates are ≡ -( ) R R a 2 j z j .
Figure 4 Non-optimal circuit implementing the Paley-ordered Walsh operators ˆ w 1 through ˆ w 7 . Dashed lines separate the sub circuits for each of the individual Walsh functions. The rotation gates are ≡ -( ) R R a 2 j z j .CC-BY · From the PDF
Figure 5 Optimal circuit implementing all 7 Walsh operators on 3 qubits. The Walsh operators are fi rst reordered in sequency order (but keeping the Paley indices). Then all but one CNOT in between adjacent rotation gates cancels. This circuit is equivalent to the one in fi gure 4. The rotation gates are ≡ -( ) R R a 2 j z j .
Figure 5 Optimal circuit implementing all 7 Walsh operators on 3 qubits. The Walsh operators are fi rst reordered in sequency order (but keeping the Paley indices). Then all but one CNOT in between adjacent rotation gates cancels. This circuit is equivalent to the one in fi gure 4. The rotation gates are ≡ -( ) R R a 2 j z j .CC-BY · From the PDF
Image 6
CC-BY · From the PDF
Figure 6 Eckart barrier, A a x sech ( ) , with A = 1, a = 0.05. In blue is the exact function and in green is a 19-term partial Walsh -Fourier series, which is accurate to 10%. The largest Paley index of these terms is 67. Therefore at least seven qubits are needed to implement this approximation.
Figure 6 Eckart barrier, A a x sech ( ) , with A = 1, a = 0.05. In blue is the exact function and in green is a 19-term partial Walsh -Fourier series, which is accurate to 10%. The largest Paley index of these terms is 67. Therefore at least seven qubits are needed to implement this approximation.CC-BY · From the PDF
Figure 7 Plots of ψ x t ( , ) 2 for the Eckart barrier simulation with different error tolerances on the potential. Time t is on the horizontal axis, consisting of a total evolution time of 0.6 divided into 1000 time steps (which gives a negligible Trotter error of less than 1% for the simulation parameters given below). The vertical axis contains 2 n grid points, with n different for each fi gure and -⩽ < x 5 5 . The initial state ψ ( ) x , 0 is a Gaussian wave packet given by ⎡ ⎣ ⎤ ⎦ ψ σ ∝ --+ -{ } ( ) / x x x i p x x , 0 exp ( ) 2 ( ) 0 2 2 0 0 in units such that  = = m 1 . The parameter values are = -x 3 0 , = p 15 0 , σ = 0.5 . The Eckart barrier potential is = V x A a x ( ) sech ( ) with A = 100, a = 0.5. The number of qubits n , errors in the potential and kinetic energies, number of Walsh functions n W , and fi delity of the fi nal state compared to a 10-qubit simulation with maximal resolution (1% discretization error in the potential energy and 0.4% in the kinetic energy) are (a) n = 10, ε = 1% V , ε = 0.4% K , = n 512 W ( ' exact ' ), F = 1, (b) n = 8, ε = 5% V , ε = 1.6% K , = n 30 W , F = 0.9794, (c) n = 7, ε = 10% V , ε = 3.1% K , = n 19 W , F = 0.9105, and (d) n = 6, ε = 15% V , ε = 6.25% K , = n 14 W , F = 0.6507.
Figure 7 Plots of ψ x t ( , ) 2 for the Eckart barrier simulation with different error tolerances on the potential. Time t is on the horizontal axis, consisting of a total evolution time of 0.6 divided into 1000 time steps (which gives a negligible Trotter error of less than 1% for the simulation parameters given below). The vertical axis contains 2 n grid points, with n different for each fi gure and -⩽ < x 5 5 . The initial state ψ ( ) x , 0 is a Gaussian wave packet given by ⎡ ⎣ ⎤ ⎦ ψ σ ∝ --+ -{ } ( ) / x x x i p x x , 0 exp ( ) 2 ( ) 0 2 2 0 0 in units such that  = = m 1 . The parameter values are = -x 3 0 , = p 15 0 , σ = 0.5 . The Eckart barrier potential is = V x A a x ( ) sech ( ) with A = 100, a = 0.5. The number of qubits n , errors in the potential and kinetic energies, number of Walsh functions n W , and fi delity of the fi nal state compared to a 10-qubit simulation with maximal resolution (1% discretization error in the potential energy and 0.4% in the kinetic energy) are (a) n = 10, ε = 1% V , ε = 0.4% K , = n 512 W ( ' exact ' ), F = 1, (b) n = 8, ε = 5% V , ε = 1.6% K , = n 30 W , F = 0.9794, (c) n = 7, ε = 10% V , ε = 3.1% K , = n 19 W , F = 0.9105, and (d) n = 6, ε = 15% V , ε = 6.25% K , = n 14 W , F = 0.6507.CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 18 references

Research works printed but not linked: 2

  1. Golubov B I, 1991, Mathematics and its Applications (Soviet series), 50
  2. Beauchamp K G, 1984, Applications of Walsh and Related Functions With an Introduction to Sequency Theory

Cited by

See all 117

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
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
Licence
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.