Quantum state preparation is a fundamental building block for various problems on a quantum computer. A nonunitary operator is typically designed to decay unwanted states contained in an initial state using ancilla qubits and a probabilistically action. In this Letter, we clarify that this probabilistic nature is a drag for quantum advantages: The probabilistic algorithms do not accelerate the computational process compared to classical ones. Combining quantum amplitude amplification (QAA) with multistep probabilistic algorithms is proposed to address this drawback, achieving quadratic acceleration and quantum advantages. We also find that the multistep probabilistic method with QAA exhibits advantages over quantum phase estimation in terms of infidelity. We also demonstrate it to confirm the quadratic acceleration, using a probabilistic imaginary-time evolution method as an example. Published by the American Physical Society 2024
Quantum state preparation is a fundamental building block for various problems on a quantum computer. A nonunitary operator is typically designed to decay unwanted states contained in an initial state using ancilla qubits and a probabilistically action. In this Letter, we clarify that this probabilistic nature is a drag for quantum advantages: The probabilistic algorithms do not accelerate the computational process compared to classical ones. Combining quantum amplitude amplification (QAA) with multistep probabilistic algorithms is proposed to address this drawback, achieving quadratic acceleration and quantum advantages. We also find that the multistep probabilistic method with QAA exhibits advantages over quantum phase estimation in terms of infidelity. We also demonstrate it to confirm the quadratic acceleration, using a probabilistic imaginary-time evolution method as an example. Published by the American Physical Society 2024
A probabilistic imaginary-time evolution (PITE) method was proposed as a nonvariational method to obtain a ground state on a quantum computer. In this formalism, the success probability of obtaining all imaginary-time evolution operators acting on the initial state decreases as the imaginary time proceeds. To alleviate the undesirable nature, we propose quantum circuits for PITE combined with the quantum amplitude amplification (QAA) method. We reduce the circuit depth in the combined circuit with QAA by introducing a pre-amplification operator. We successfully demonstrated that the combination of PITE and QAA works efficiently and reported a case in which the quantum acceleration is achieved. Additionally, we have found that by optimizing a parameter of PITE, we can reduce the number of QAA operations and that deterministic imaginary-time evolution (deterministic ITE) can be achieved which avoids the probabilistic nature of PITE. We applied the deterministic ITE procedure to multiple imaginary-time steps and discussed the computational cost for the circuits. Finally, as an example, we demonstrate the numerical results of the PITE circuit combined with QAA in the first- and second-quantized Hamiltonians.
We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this Lindbladian is algorithmic and should not be seen as a specific approximation to some weakly coupled system-bath dynamics in nature. Our algorithm can be implemented using just one ancilla qubit and efficiently simulated on a quantum computer. It can prepare the ground state even when the initial state has zero overlap with the ground state, bypassing the most significant limitation of methods like quantum phase estimation. As a variant, we also propose a discrete-time algorithm, demonstrating even better efficiency and providing a near-optimal simulation cost depending on the desired evolution time and precision. Numerical simulations using Ising and Hubbard models demonstrate the efficacy and applicability of our method. Published by the American Physical Society 2024
Constraint satisfaction problems (CSPs) represent a fundamental challenge in computer science and artificial intelligence. The inherent complexity of many CSP instances, often exhibiting NP-hardness, necessitates efficient solving strategies. Classical CSP solvers frequently encounter difficulties when scaling to larger problem sizes, leading to exponential time growth. This paper proposes a novel approach to CSP solving inspired by quantum amplitude amplification (QAA), a technique utilized in quantum computation for estimating probabilities of states. Our method, termed Quantum-Inspired Constraint Satisfaction (QICS), utilizes concepts of superposition and interference to accelerate the exploration of the solution space. QICS constructs a probabilistic model where variable assignments are represented as amplitudes, and iteratively amplifies amplitudes associated with satisfying assignments, thereby enhancing the likelihood of discovering solutions. The core of the algorithm lies in a carefully designed update rule that balances exploration and exploitation, mimicking the probabilistic nature of quantum mechanics. We demonstrate, through theoretical analysis and conceptual design, the potential for QICS to achieve significant speedups compared to traditional deterministic CSP solvers, particularly for problems with specific structural characteristics. This work lays the groundwork for a new paradigm in CSP solving, bridging the gap between classical and quantum computational approaches.
Quantum algorithms for ground-state energy estimation of chemical systems require a high-quality initial state. However, initial state preparation is commonly either neglected entirely, or assumed to be solved by a simple product state like Hartree-Fock. Even if a nontrivial state is prepared, strong correlations render ground-state overlap inadequate for quality assessment. In this work, we address the initial state preparation problem with an end-to-end algorithm that and the quality of initial states, accomplishing the latter with a new metric—the energy distribution. To be able to prepare more complicated initial states, we introduce an implementation technique for states in the form of a sum of Slater determinants that exhibits significantly better scaling than all prior approaches. We also propose low-precision quantum phase estimation (QPE) for further state quality refinement. The complete algorithm is capable of generating high-quality states for energy estimation, and is shown in select cases to lower the overall estimation cost by several orders of magnitude when compared with the best single product state ansatz. More broadly, the energy distribution picture suggests that the goal of QPE should be reinterpreted as generating improvements compared to the energy of the initial state and other classical estimates: such an improvement can still be achieved even if QPE does not project directly onto the ground state. Finally, we show how the energy distribution can help in identifying potential quantum advantage. Published by the American Physical Society 2024
The simulation of quantum physical systems is expected to be an important application for quantum computers. The work presented in this dissertation aims to improve the resource requirements of quantum computers for solving simulation problems, by providing both novel quantum algorithms and improved implementations of existing ones. I present three main results that cover diverse aspects of simulation including equilibrium physics, the preparation of useful quantum states, and simulations based on classical stochastic processes. The results rely on established quantum algorithms and other recent techniques which I review. My first original contribution is a new quantum algorithm to sample from the thermal Gibbs state of quantum Hamiltonians. The complexity of this algorithm has an exponentially improved dependence on precision compared to an earlier quantum algorithm, and also provides polynomial improvements in other parameters. My second contribution is an improved algorithm to implement reflections about the eigenstates of unitary operators and Hamiltonians, an operation that can be used to prepare ground states of many-body Hamiltonians by quantum amplitude amplification. The improved algorithm for implementing reflections significantly reduces the number of ancilla qubits required over earlier implementations. The improvement relies in part on a novel quantum algorithm for efficiently preparing states with Gaussian-like amplitudes, which may have broad applications. I also prove a lower bound for implementing reflections, which shows that our algorithm is almost optimal. My third and final contribution regards quantum algorithms for classical stochastic processes, which are of importance in statistical physics. I present a quantum algorithm that estimates the average running time of a stochastic process, and provides a quadratic speed-up over a comparable classical algorithm.
Quantum Amplitude Amplification (QAA), the generalization of Grover's algorithm, is well-positioned for combinatorial optimization and is particularly promising for Quadratic Unconstrained Binary Optimization (QUBO) problems. QAA is appealing due to its ability to drive the quantum system to a target state, yielding the globally optimal solution with probability over 90+%. However, realizing QAA for application-scale optimization currently exceeds quantum hardware capacity, which is further compounded by unresolved algorithmic challenges regarding the choice of free parameters. In this study, we address these issues by utilizing a realistic traffic flow QUBO problem to investigate the implementation of QAA as a heuristic solver. Specifically, allowing the diffusion operator parameter to take non-π values expands the capabilities of QAA. This unlocks a new multiple-shot, low-iteration strategy that aims for a high cumulative probability rather than maximizing the probability of a single basis state. Using 25-qubit simulations, our results demonstrate that heuristic QAA addresses two of the main challenges cited in previous studies. Firstly, heuristic QAA works even at a single iteration, reducing circuit depth by orders of magnitude compared to standard QAA. And secondly, we show that the problem-dependent parameters necessary for reaching optimal algorithmic performance can be reliably approximated with minimal upfront classical computing overhead.