Low-depth measurement-based deterministic quantum state preparation

• URL: http://arxiv.org/abs/2510.08267v1
• Date: Thu, 09 Oct 2025 14:22:26 GMT
• Title: Low-depth measurement-based deterministic quantum state preparation
• Authors: Roselyn Nmaju, Fiona Speirits, Sarah Croke,
• Abstract summary: We present a low-depth amplitude encoding method for arbitrary quantum state preparation.<n>Building on an existing divide-and-conquer algorithm, we propose a method to disentangle the ancillary qubits from the final state.<n>Our method is measurement-based but deterministic, and offers an alternative approach to existing state preparation algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a low-depth amplitude encoding method for arbitrary quantum state preparation. Building on the foundation of an existing divide-and-conquer algorithm, we propose a method to disentangle the ancillary qubits from the final state. Our method is measurement-based but deterministic, and offers an alternative approach to existing state preparation algorithms. It has circuit depth O(n), which is known to be optimal, and O(2^n) ancilla qubits, which is close to optimal. We illustrate our method through detailed worked examples of both a ``dense'' state and a W-state. We discuss extensions to the algorithm resetting qubits mid-circuit, and construct hybrid algorithms with varying space and circuit depth complexities.

Related papers

• Algebraic Reduction to Improve an Optimally Bounded Quantum State Preparation Algorithm [0.6875312133832078]
  Preparation of $n$-qubit quantum states is a cross-cutting subroutine for many quantum algorithms.<n>A simpler algebraic decomposition is proposed to separate the preparation of the real part of the desired state from the complex one.<n>The reduction in complexity is due to the use of a single operator $$ for each uniformly controlled gate, instead of the three in the original decomposition.
  arXiv  Detail & Related papers  (2026-02-06T09:40:09Z)
• Near-Heisenberg-limited parallel amplitude estimation with logarithmic depth circuit [0.39102514525861415]
  This paper gives a parallelized amplitude estimation (PAE) algorithm, that simultaneously achieves near-Heisenberg scaling in the total number of queries and sub-linear scaling in the circuit depth.<n>The proposed algorithm has a form of distributed quantum computing, which may be suitable for device implementation.
  arXiv  Detail & Related papers  (2025-08-08T08:38:14Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Entanglement-induced exponential advantage in amplitude estimation via state matrixization [11.282486674587236]
  Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing.<n>We introduce a novel algorithmic framework for quantum amplitude estimation by transforming pure states into their matrix forms.<n>We reconstruct amplitude estimation algorithms within the novel matrixization framework through a technique known as channel block encoding.
  arXiv  Detail & Related papers  (2024-08-25T04:35:53Z)
• Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms [64.10576998630981]
  We show the first tight characterization of the optimal Hessian-dependent sample complexity. A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances. The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
  arXiv  Detail & Related papers  (2023-06-21T17:03:22Z)
• Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach [1.237454174824584]
  We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS)<n>Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body Hamiltonians.<n>For simulation problems on 100 qubits, we show that AQCtensor achieves at least an order of magnitude reduction in the depth of the resulting optimized circuit.
  arXiv  Detail & Related papers  (2023-01-20T14:40:29Z)
• Quantum Mixed State Compiling [3.848364262836074]
  We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm represents a generalization of previous VQAs that aimed at learning preparation circuits for pure states.
  arXiv  Detail & Related papers  (2022-09-01T15:21:41Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• ES-Based Jacobian Enables Faster Bilevel Optimization [53.675623215542515]
  Bilevel optimization (BO) has arisen as a powerful tool for solving many modern machine learning problems. Existing gradient-based methods require second-order derivative approximations via Jacobian- or/and Hessian-vector computations. We propose a novel BO algorithm, which adopts Evolution Strategies (ES) based method to approximate the response Jacobian matrix in the hypergradient of BO.
  arXiv  Detail & Related papers  (2021-10-13T19:36:50Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks [79.16773494166644]
  We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network. We design two optimal algorithms that attain these lower bounds. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-08T15:54:44Z)

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.