Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Reducing the Depth of Quantum Circuits Using Additional Circuit Lines

Nabila Abdessaied, Robert Wille, Mathias Soeken, Rolf Drechsler

Published Jan 1, 2013• 29 citations
Publisher
DOI
10.1007/978-3-642-38986-3_18

Related papers

Feedback-based quantum optimization with low depth and measurement

Zi-Wen Huang, Jia-Cheng Fan, Xiao-Hui Ni +5 more

Feedback-based ALgorithm for Quantum OptimizatioN (FALQON) is a hybrid quantum-classical algorithm for solving combinatorial optimization problems, which circumvents classical parameter optimization but requires a deep quantum circuit. To reduce circuit depth, Arai et al. proposed second-order FALQON (SO-FALQON), achieving the best depth reduction among existing approaches. However, SO-FALQON brings a 2.3 times per-step measurement overhead, as it needs to calculate an additional second-order control coefficient. In this paper, inspired by the Backtracking Line Search (BLS) theory, we propose another method called BLS-FALQON, which not only reduces circuit depth to a comparable extent, but also achieves fewer measurements than SO-FALQON. Numerical simulations on max-cut problem with 8 to 20 vertices demonstrate that BLS-FALQON reduces the total measurement count by 37.7% compared to SO-FALQON, while maintaining a comparable circuit depth. Furthermore, we conduct real quantum hardware experiments on the Tianyan-176 quantum computer, which uses the zuchongzhi2 superconducting quantum processor, confirming that BLS-FALQON remains effective under real quantum hardware conditions.

quant-pharXiv:2609.32433•Sep 29, 2026•0 citations

Reducing Wires in Quantum Computers

Michael Schirber

Physics•Apr 14, 2026•0 citations

Measurement-based long-range entangling gates in constant depth

Elisa Bäumer, Stefan Woerner

The depth of quantum circuits is a critical factor when running them on state-of-the-art quantum devices owing to their limited coherence times. Reducing circuit depth decreases noise in near-term quantum computations and reduces overall computation time. This also benefits fault-tolerant quantum computations. Here, we show how to reduce the depth of quantum subroutines that typically scale linearly with the number of qubits, such as quantum fan-out and long-range CNOT gates, to a constant depth using mid-circuit measurements and feedforward operations, while only requiring a 1D line topology. We compare our protocols with existing ones to highlight their advantages. Additionally, we verify the feasibility by implementing the measurement-based quantum fan-out gate and long-range CNOT gate on real quantum hardware, demonstrating significant improvements over their unitary implementations.

arXiv:2408.03064•Physical Review Research•May 6, 2025•51 citations

Setting Ground Rules for Quantum Circuits

Anonymous

Physics•Jan 17, 2013•0 citations

Towards quantum electrical circuits

D. Vion, A. Aassime, Audrey Cottet +5 more

Physica E Low-dimensional Systems and Nanostructures•Mar 4, 2003•2 citations

Quantum circuits of T -depth one

Peter Selinger

We give a $\text{Clifford}+T$ representation of the Toffoli gate of $T$-depth one, using four ancillas. More generally, we describe a class of circuits whose $T$-depth can be reduced to one by using sufficiently many ancillas. We show that the cost of adding an additional control to any controlled gate is at most eight additional $T$ gates and $T$-depth two. We also show that the circuit $THT$ does not possess a $T$-depth one representation with an arbitrary number of ancillas initialized to $|0\ensuremath{\rangle}$.

arXiv:1210.0974•Physical Review A•Apr 1, 2013•254 citations
Feedback-based ALgorithm for Quantum OptimizatioN (FALQON) is a hybrid quantum-classical algorithm for solving combinatorial optimization problems, which circumvents classical parameter optimization but requires a deep quantum circuit. To reduce circuit depth, Arai et al. proposed second-order FALQON (SO-FALQON), achieving the best depth reduction among existing approaches. However, SO-FALQON brings a 2.3 times per-step measurement overhead, as it needs to calculate an additional second-order control coefficient. In this paper, inspired by the Backtracking Line Search (BLS) theory, we propose another method called BLS-FALQON, which not only reduces circuit depth to a comparable extent, but also achieves fewer measurements than SO-FALQON. Numerical simulations on max-cut problem with 8 to 20 vertices demonstrate that BLS-FALQON reduces the total measurement count by 37.7% compared to SO-FALQON, while maintaining a comparable circuit depth. Furthermore, we conduct real quantum hardware experiments on the Tianyan-176 quantum computer, which uses the zuchongzhi2 superconducting quantum processor, confirming that BLS-FALQON remains effective under real quantum hardware conditions.
The depth of quantum circuits is a critical factor when running them on state-of-the-art quantum devices owing to their limited coherence times. Reducing circuit depth decreases noise in near-term quantum computations and reduces overall computation time. This also benefits fault-tolerant quantum computations. Here, we show how to reduce the depth of quantum subroutines that typically scale linearly with the number of qubits, such as quantum fan-out and long-range CNOT gates, to a constant depth using mid-circuit measurements and feedforward operations, while only requiring a 1D line topology. We compare our protocols with existing ones to highlight their advantages. Additionally, we verify the feasibility by implementing the measurement-based quantum fan-out gate and long-range CNOT gate on real quantum hardware, demonstrating significant improvements over their unitary implementations.
We give a Clifford+T\text{Clifford}+TClifford+T representation of the Toffoli gate of TTT-depth one, using four ancillas. More generally, we describe a class of circuits whose TTT-depth can be reduced to one by using sufficiently many ancillas. We show that the cost of adding an additional control to any controlled gate is at most eight additional TTT gates and TTT-depth two. We also show that the circuit THTTHTTHT does not possess a TTT-depth one representation with an arbitrary number of ancillas initialized to $|0\ensuremath{\rangle}$.