Arbitrary state creation via controlled measurement

• URL: http://arxiv.org/abs/2504.09462v2
• Date: Wed, 30 Apr 2025 04:28:10 GMT
• Title: Arbitrary state creation via controlled measurement
• Authors: Alexander I. Zenchuk, Wentao Qi, Junde Wu,
• Abstract summary: This algorithm creates an arbitrary $n$-qubit pure quantum superposition state with precision of $m$-decimals.<n>The algorithm uses one-qubit rotations, Hadamard transformations and C-NOT operations with multi-qubit controls.
• Score: 49.494595696663524
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The initial state creation is a starting point of many quantum algorithms and usually is considered as a separate subroutine not included into the algorithm itself. There are many algorithms aimed on creation of special class of states. Our algorithm allows creating an arbitrary $n$-qubit pure quantum superposition state with precision of $m$-decimals (binary representation) for each probability amplitude. The algorithm uses one-qubit rotations, Hadamard transformations and C-NOT operations with multi-qubit controls. However, the crucial operation is the final controlled measurement of the ancilla state that removes the garbage part of the superposition state and allows to avoid the problem of small success probability in that measurement. We emphasize that rotation angles are predicted in advance by the required precision and therefore there is no classical calculation supplementing quantum algorithm. The depth and space of the algorithm growth with $n$ as, respectively, $O(2^n n)$ and $O(n)$. This algorithm can be a subroutine generating the required input state in various algorithms, in particular, in matrix-manipulation algorithms developed earlier.

Related papers

• Quantum Hermitian conjugate and encoding unnormalized matrices [49.494595696663524]
  We develop the family of matrix-manipulation algorithms based on the encoding the matrix elements into the probability amplitudes of the pure superposition state of a certain quantum system.<n>We introduce two extensions to these algorithms which allow (i) to perform Hermitian conjugation of matrices under consideration and (ii) to weaken the restriction to the absolute values of matrix elements unavoidably imposed by the normalization condition for a pure quantum state.
  arXiv  Detail & Related papers  (2025-03-27T08:49:59Z)
• Space-Efficient Quantum Error Reduction without log Factors [50.10645865330582]
  We present a new highly simplified construction of a purifier, that can be understood as a weighted walk on a line similar to a random walk interpretation of majority voting. Our purifier has exponentially better space complexity than the previous one, and quadratically better dependence on the soundness-completeness gap of the algorithm being purified.
  arXiv  Detail & Related papers  (2025-02-13T12:04:39Z)
• Remarks on controlled measurement and quantum algorithm for calculating Hermitian conjugate [46.13392585104221]
  We present two new aspects for the recently proposed algorithms for matrix manipulating.<n>First aspect is the controlled measurement which allows to avoid the problem of small access probability to the required ancilla state.<n>Second aspect is the algorithm for calculating the Hermitian conjugate of an arbitrary matrix.
  arXiv  Detail & Related papers  (2025-01-27T13:11:47Z)
• Bregman-divergence-based Arimoto-Blahut algorithm [53.64687146666141]
  We generalize the Arimoto-Blahut algorithm to a general function defined over Bregman-divergence system.<n>This algorithm can be applied to classical and quantum rate-distortion theory.
  arXiv  Detail & Related papers  (2024-08-10T06:16:24Z)
• Generalized quantum Arimoto-Blahut algorithm and its application to quantum information bottleneck [55.22418739014892]
  We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al. We apply our algorithm to the quantum information bottleneck with three quantum systems. Our numerical analysis shows that our algorithm is better than their algorithm.
  arXiv  Detail & Related papers  (2023-11-19T00:06:11Z)
• A simple quantum algorithm to efficiently prepare sparse states [0.0]
  We show that the gate complexity is linear in the number of non-zero amplitudes in the state and quadratic in the number of qubits. This is competitive with the best known algorithms for sparse state preparation.
  arXiv  Detail & Related papers  (2023-10-30T07:05:15Z)
• Distributed Phase Estimation Algorithm and Distributed Shor's Algorithm [4.199844472131922]
  Shor's algorithm is one of the most significant quantum algorithms. It requires an unbearable amount of qubits in the NISQ era. We propose a new distributed phase estimation algorithm.
  arXiv  Detail & Related papers  (2023-04-24T13:52:05Z)
• An adaptive Bayesian quantum algorithm for phase estimation [0.0]
  We present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound.
  arXiv  Detail & Related papers  (2023-03-02T19:00:01Z)
• Private estimation algorithms for stochastic block models and mixture models [63.07482515700984]
  General tools for designing efficient private estimation algorithms. First efficient $(epsilon, delta)$-differentially private algorithm for both weak recovery and exact recovery.
  arXiv  Detail & Related papers  (2023-01-11T09:12:28Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Black-Box Quantum State Preparation with Inverse Coefficients [17.63187488168065]
  Black-box quantum state preparation is a fundamental building block for many higher-level quantum algorithms. We present a new algorithm for performing black-box state preparation with inverse coefficients based on the technique of inequality test.
  arXiv  Detail & Related papers  (2021-12-11T09:22:25Z)
• Self-Guided Quantum State Learning for Mixed States [7.270980742378388]
  The salient features of our algorithm are efficient $O left( d3 right)$ post-processing in the infidelity dimension $d$ of the state. A higher resilience against measurement noise makes our algorithm suitable for noisy intermediate-scale quantum applications.
  arXiv  Detail & Related papers  (2021-06-11T04:40:26Z)
• Higher-order Derivatives of Weighted Finite-state Machines [68.43084108204741]
  This work examines the computation of higher-order derivatives with respect to the normalization constant for weighted finite-state machines. We provide a general algorithm for evaluating derivatives of all orders, which has not been previously described in the literature. Our algorithm is significantly faster than prior algorithms.
  arXiv  Detail & Related papers  (2021-06-01T19:51:55Z)
• Quantum Algorithms for Prediction Based on Ridge Regression [0.7612218105739107]
  We propose a quantum algorithm based on ridge regression model, which get the optimal fitting parameters. The proposed algorithm has a wide range of application and the proposed algorithm can be used as a subroutine of other quantum algorithms.
  arXiv  Detail & Related papers  (2021-04-27T11:03:52Z)
• Low depth algorithms for quantum amplitude estimation [6.148105657815341]
  We design and analyze two new low depth algorithms for amplitude estimation (AE) These algorithms bring quantum speedups for Monte Carlo methods closer to realization.
  arXiv  Detail & Related papers  (2020-12-06T18:39:20Z)
• Quantum state preparation with multiplicative amplitude transduction [0.0]
  Two variants of the algorithm with different emphases are introduced. One variant uses fewer qubits and no controlled gates, while the other variant potentially requires fewer gates overall. A general analysis is given to estimate the number of qubits necessary to achieve a desired precision in the amplitudes of the computational basis states.
  arXiv  Detail & Related papers  (2020-06-01T14:36:50Z)
• Active Model Estimation in Markov Decision Processes [108.46146218973189]
  We study the problem of efficient exploration in order to learn an accurate model of an environment, modeled as a Markov decision process (MDP) We show that our Markov-based algorithm outperforms both our original algorithm and the maximum entropy algorithm in the small sample regime.
  arXiv  Detail & Related papers  (2020-03-06T16:17:24Z)

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.