Constant-Depth Quantum Circuits for Arbitrary Quantum State Preparation via Measurement and Feedback

• URL: http://arxiv.org/abs/2503.16208v1
• Date: Thu, 20 Mar 2025 14:55:04 GMT
• Title: Constant-Depth Quantum Circuits for Arbitrary Quantum State Preparation via Measurement and Feedback
• Authors: Wei Zi, Junhong Nie, Xiaoming Sun,
• Abstract summary: We develop a framework to achieve constant-depth implementations of essential quantum tasks.<n>This includes preparing arbitrary quantum states with constant-depth circuits through measurement and feedback.<n>Our result paves the way for general quantum circuit compression using measurement and feedback.
• Score: 5.9862846364925115
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The optimization of quantum circuit depth is crucial for practical quantum computing, as limited coherence times and error-prone operations constrain executable algorithms. Measurement and feedback operations are fundamental in quantum computing (e.g., quantum error correction); we develop a framework using them to achieve constant-depth implementations of essential quantum tasks. This includes preparing arbitrary quantum states with constant-depth circuits through measurement and feedback, breaking the linear-depth lower bound that is required without these operations. Our result paves the way for general quantum circuit compression using measurement and feedback.

Related papers

• Quantum Measurement for Quantum Chemistry on a Quantum Computer [0.0]
  A critical component of any quantum algorithm is the measurement step, where the desired properties are extracted from a quantum computer.<n>This review focuses on recent advancements in quantum measurement techniques tailored for quantum chemistry.
  arXiv  Detail & Related papers  (2025-01-24T23:06:32Z)
• Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward [0.0]
  Mid-circuit measurement and feedforward have been shown to significantly reduce the depth of quantum circuits.<n>We propose several parallelization strategies that reduce quantum circuit depth at the expense of increasing width.
  arXiv  Detail & Related papers  (2025-01-06T11:08:55Z)
• Measurement-Based Long-Range Entangling Gates in Constant Depth [0.46040036610482665]
  We show how to reduce the depth of quantum sub-routines to a constant depth using mid-circuit measurements and feed-forward operations. We verify the feasibility by implementing the measurement-based quantum fan-out gate and long-range CNOT gate on real quantum hardware.
  arXiv  Detail & Related papers  (2024-08-06T09:35:42Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Mapping quantum circuits to shallow-depth measurement patterns based on graph states [0.0]
  We create a hybrid simulation technique for measurement-based quantum computing. We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements. We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
  arXiv  Detail & Related papers  (2023-11-27T19:00:00Z)
• Dynamic quantum circuit compilation [11.550577505893367]
  Recent advancements in quantum hardware have introduced mid-circuit measurements and resets, enabling the reuse of measured qubits. We present a systematic study of dynamic quantum circuit compilation, a process that transforms static quantum circuits into their dynamic equivalents.
  arXiv  Detail & Related papers  (2023-10-17T06:26:30Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Escaping from the Barren Plateau via Gaussian Initializations in Deep Variational Quantum Circuits [63.83649593474856]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.<n>However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.<n>This result leads to a general standpoint that deep quantum circuits would not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.