Quantum Zeno Monte Carlo for computing observables

• URL: http://arxiv.org/abs/2403.02763v3
• Date: Thu, 9 May 2024 04:06:27 GMT
• Title: Quantum Zeno Monte Carlo for computing observables
• Authors: Mancheon Han, Hyowon Park, Sangkook Choi,
• Abstract summary: We introduce a new classical-quantum hybrid algorithm termed Quantum Zeno Monte Carlo (QZMC) QZMC is capable of handling noises and Trotter errors while demonstrating computational cost. Compared to quantum phase estimation, QZMC offers a significantly reduced quantum circuit depth.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The recent development of logical quantum processors signifies a pivotal moment in the progression from the noisy intermediate-scale quantum (NISQ) era to the fault-tolerant quantum computing (FTQC) era. These advanced devices are poised to alter the approach to problems that challenge classical computation methods. By transforming such problems into Hamiltonian frameworks and exploiting quantum mechanical properties, these processors have the potential to address complex issues within a polynomial computational time. However, despite their advancements, these processors remain vulnerable to disruptive noise, highlighting the need for robust quantum algorithms designed to manage noise effectively. In response to this need, we introduce a new classical-quantum hybrid algorithm termed Quantum Zeno Monte Carlo (QZMC). QZMC is capable of handling device noises and Trotter errors while demonstrating polynomial computational cost. This algorithm combines the quantum Zeno effect with Monte Carlo integration techniques, facilitating multi-step transitions toward targeted eigenstates of the Hamiltonian problem. Notably, QZMC does not require overlap between the initial state and the target state, nor does it depend on variational parameters. It can compute static and dynamic properties of the targeted states, including ground state energy, excited state energies, and Green's functions. Compared to quantum phase estimation, QZMC offers a significantly reduced quantum circuit depth. These features make QZMC an important algorithm for navigating the current transitional phase in quantum computing and beyond.

Related papers

• Correcting and extending Trotterized quantum many-body dynamics [0.0]
  We develop a hybrid ansatz that combines the strengths of quantum and classical methods. We show how this hybrid ansatz can avoid SWAP gates in the quantum circuit. We also show how it can extend the system size while keeping the number of qubits on the quantum device constant.
  arXiv  Detail & Related papers  (2025-02-19T14:50:12Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Simulating open quantum many-body systems using optimised circuits in digital quantum simulation [0.0]
  We study models in open quantum systems with Trotterisations for the modified Schr"odinger equation (MSSE) Minimising the leading error in MSSE enables to optimise the quantum circuits. We run the algorithm on the IBM Quantum devices, showing that the current machine is challenging to give quantitatively accurate time dynamics due to the noise.
  arXiv  Detail & Related papers  (2022-03-27T13:00:02Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise [1.5162649964542718]
  Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the prospect to efficiently perform such computations. Current quantum devices still suffer from inherent quantum noise.
  arXiv  Detail & Related papers  (2021-11-30T16:08:01Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Quantum simulation of open quantum systems in heavy-ion collisions [0.0]
  We present a framework to simulate the dynamics of hard probes such as heavy quarks or jets in a hot, strongly-coupled quark-gluon plasma (QGP) on a quantum computer. Our work demonstrates the feasibility of simulating open quantum systems on current and near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-07T18:00:02Z)

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.