Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation

• URL: http://arxiv.org/abs/2011.01055v2
• Date: Sun, 18 Apr 2021 08:36:53 GMT
• Title: Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
• Authors: Qingxiuxiong Dong, Marco T\'ulio Quintino, Akihito Soeda, Mio Murao
• Abstract summary: We propose a new structure for probabilistic higher-order transformation named success-or-draw, which allows a repeat-until-success implementation. We then present a semidefinite programming approach to obtain optimal success-or-draw protocols and analyze in detail the problem of inverting a general unitary operation.
• Score: 4.014524824655106
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Repeat-until-success strategy is a standard method to obtain success with a probability which grows exponentially in the number of iterations. However, since quantum systems are disturbed after a quantum measurement, it is not straightforward how to perform repeat-until-success strategies in certain quantum algorithms. In this paper, we propose a new structure for probabilistic higher-order transformation named success-or-draw, which allows a repeat-until-success implementation. For that we provide a universal construction of success-or-draw structure which works for any probabilistic higher-order transformation on unitary operations. We then present a semidefinite programming approach to obtain optimal success-or-draw protocols and analyze in detail the problem of inverting a general unitary operation.

Related papers

• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Deterministic Quantum Search for Arbitrary Initial Success Probabilities [0.0]
  This work presents a deterministic quantum search algorithm that operates effectively for arbitrary initial success probabilities.<n>The proposed approach introduces at most one additional iteration beyond the optimal count required by probabilistic quantum search algorithms.
  arXiv  Detail & Related papers  (2025-05-21T13:35:42Z)
• Success probability in Shor's Algorithm [0.0]
  This paper aims to determine the exact success probability at each step of Shor's algorithm. The derived formulas enable the identification of all failure cases in Shor's algorithm, which correspond to a success probability of zero.
  arXiv  Detail & Related papers  (2025-05-01T10:08:58Z)
• Quantum Advantage in Reversing Unknown Unitary Evolutions [9.259390080722206]
  We introduce the Quantum Unitary Reversal Algorithm (QURA), a deterministic and exact approach to universally reverse arbitrary unknown unitary transformations. QURA ensures an exact unitary inversion while the classical counterpart can never achieve exact inversion using a finite number of unitary calls.
  arXiv  Detail & Related papers  (2024-03-07T17:59:11Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• 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)
• Improvement of quantum walk-based search algorithms in single marked vertex graphs [0.0]
  Amplitude amplification is usually used to amplify success probability, but the souffl'e problems follow. In this work, we define generalized interpolated quantum walks, which can both improve the success probability of search algorithms and avoid the souffl'e problems.
  arXiv  Detail & Related papers  (2022-09-09T07:43:46Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Gaussian initializations help deep variational quantum circuits escape from the barren plateau [87.04438831673063]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. 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. This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Preparation of quantum superposition using partial negation [1.911678487931003]
  The speed of the preparation process and the accuracy of the prepared superposition has a special importance to the success of any quantum algorithm. The proposed method can be used to prepare the required quantum superposition in $mathcalO(n)$ steps.
  arXiv  Detail & Related papers  (2021-09-29T11:57:44Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes [2.538209532048866]
  We present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes. In the special case of multi-shot channel discrimination, it can be shown that the ultimate success probability increases by at most a constant factor determined by the given channels. We also present a lower bound based on Bayesian updating, which has a low computational cost.
  arXiv  Detail & Related papers  (2020-12-27T01:14:23Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Revisiting Shor's quantum algorithm for computing general discrete logarithms [0.0]
  We show that Shor's algorithm for computing general discrete logarithms achieves an expected success probability of approximately 60% to 82% in a single run. By slightly increasing the number of group operations that are evaluated quantumly, we show how the algorithm can be further modified to achieve a success probability thatally exceeds 99% in a single run.
  arXiv  Detail & Related papers  (2019-05-22T11:47:38Z)

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.