Acceleration of probabilistic imaginary-time evolution method combined with quantum amplitude amplification

• URL: http://arxiv.org/abs/2212.13816v1
• Date: Wed, 28 Dec 2022 13:34:33 GMT
• Title: Acceleration of probabilistic imaginary-time evolution method combined with quantum amplitude amplification
• Authors: Hirofumi Nishi, Taichi Kosugi, Yusuke Nishiya, Yu-ichiro Matsushita
• Abstract summary: 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. We propose quantum circuits for PITE combined with the quantum amplitude amplification (QAA) method.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Double-bracket quantum algorithms for quantum imaginary-time evolution [0.0]
  We prove that our Double-Bracket Quantum Imaginary-Time Evolution (DB-QITE) algorithm inherits the cooling guarantees of imaginary-time evolution. DB-QITE provides a means to systematically improve the approximation of a ground-state using shallow circuits.
  arXiv  Detail & Related papers  (2024-12-05T19:00:09Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Quantum Generative Diffusion Model: A Fully Quantum-Mechanical Model for Generating Quantum State Ensemble [40.06696963935616]
  We introduce Quantum Generative Diffusion Model (QGDM) as their simple and elegant quantum counterpart. QGDM exhibits faster convergence than Quantum Generative Adversarial Network (QGAN) It can achieve 53.02% higher fidelity in mixed-state generation than QGAN.
  arXiv  Detail & Related papers  (2024-01-13T10:56:34Z)
• Adaptive Circuit Learning of Born Machine: Towards Realization of Amplitude Embedding and Data Loading [7.88657961743755]
  We present a novel algorithm "Adaptive Circuit Learning of Born Machine" (ACLBM) Our algorithm is tailored to selectively integrate two-qubit entangled gates that best capture the complex entanglement present within the target state. Empirical results underscore the proficiency of our approach in encoding real-world data through amplitude embedding.
  arXiv  Detail & Related papers  (2023-11-29T16:47:31Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Simulating non-unitary dynamics using quantum signal processing with unitary block encoding [0.0]
  We adapt a recent advance in resource-frugal quantum signal processing to explore non-unitary imaginary time evolution on quantum computers. We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states. We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.
  arXiv  Detail & Related papers  (2023-03-10T19:00:33Z)
• Improved algorithms of quantum imaginary time evolution for ground and excited states of molecular systems [0.0]
  Quantum imaginary time evolution (QITE) is a recently proposed quantum-classical hybrid algorithm that is guaranteed to reach the lowest state of system. We analyze the derivation of the underlying QITE equation order-by-order, and suggest a modification that is theoretically well founded. We also discuss how to accurately estimate the norm of an imaginary-time-evolved state, and applied it to excited state calculations.
  arXiv  Detail & Related papers  (2022-05-04T10:32:16Z)
• Probabilistic imaginary-time evolution by using forward and backward real-time evolution with a single ancilla: first-quantized eigensolver of quantum chemistry for ground states [0.0]
  Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. We propose a new approach of PITE which requires only a single ancillary qubit. We discuss the application of our approach to quantum chemistry by focusing on the scaling of computational cost.
  arXiv  Detail & Related papers  (2021-11-24T12:54:27Z)
• Automatically Differentiable Quantum Circuit for Many-qubit State Preparation [1.5662820454886202]
  We propose the automatically differentiable quantum circuit (ADQC) approach to efficiently prepare arbitrary quantum many-qubit states. The circuit is optimized by updating the latent gates using back propagation to minimize the distance between the evolved and target states. Our work sheds light on the "intelligent construction" of quantum circuits for many-qubit systems by combining with the machine learning methods.
  arXiv  Detail & Related papers  (2021-04-30T12:22:26Z)
• Experimental Realization of Nonadiabatic Holonomic Single-Qubit Quantum Gates with Two Dark Paths in a Trapped Ion [41.36300605844117]
  We show nonadiabatic holonomic single-qubit quantum gates on two dark paths in a trapped $171mathrmYb+$ ion based on four-level systems with resonant drives. We find that nontrivial holonomic two-qubit quantum gates can also be realized within current experimental technologies.
  arXiv  Detail & Related papers  (2021-01-19T06:57:50Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• 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)

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.