Tensor-based quantum phase difference estimation for large-scale demonstration

• URL: http://arxiv.org/abs/2408.04946v3
• Date: Fri, 25 Oct 2024 07:51:21 GMT
• Title: Tensor-based quantum phase difference estimation for large-scale demonstration
• Authors: Shu Kanno, Kenji Sugisaki, Hajime Nakamura, Hiroshi Yamauchi, Rei Sakuma, Takao Kobayashi, Qi Gao, Naoki Yamamoto,
• Abstract summary: We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme. Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially. We demonstrate energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices.
• Score: 3.492424366069693
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme and a tensor-network-based unitary compression method in the preparation of superposition states and time-evolution gates. Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially. We demonstrated energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices using circuits up to 32-system (plus one-ancilla) qubits, a five-fold increase over previous QPE demonstrations, at the 7242 controlled-Z gate level of standard transpilation, utilizing a Q-CTRL error suppression module. Additionally, we propose a technique towards molecular executions using spatial orbital localization and index sorting, verified by a 13- (17-)qubit hexatriene (octatetraene) simulation. Since QPDE can handle the same objectives as QPE, our algorithm represents a leap forward in quantum computing on real devices.

Related papers

• Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster [0.0]
  This study aims to accelerate quantum simulation using two newly proposed methods. We achieved 200 times higher speed over VQE simulations and demonstrated 32 qubits ground-state energy calculations in acceptable time.
  arXiv  Detail & Related papers  (2024-02-19T06:34:01Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• PANSATZ: Pulse-based Ansatz for Variational Quantum Algorithms [0.0]
  We develop and implement a novel pulse-based ansatz for noisy quantum computers. We find the ground-state energy associated with the electron configuration problem. We show that this ansatz has structured adaptivity to the entanglement level required by the problem.
  arXiv  Detail & Related papers  (2022-12-25T14:31:34Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers [0.471876092032107]
  Variational quantum eigensolvers (VQE) are among the most promising approaches for solving electronic structure problems on quantum computers. A critical challenge for VQE in practice is that one needs to strike a balance between the expressivity of the VQE ansatz versus the number of quantum gates required to implement the ansatz. We run end-to-end VQE algorithms with up to 12 qubits and 72 variational parameters - the largest full VQE simulation with a correlated wave function on quantum hardware.
  arXiv  Detail & Related papers  (2022-12-05T18:40:54Z)
• Fock-space Schrieffer--Wolff transformation: classically-assisted rank-reduced quantum phase estimation algorithm [0.0]
  In this paper, we focus on the Schrieffer--Wolff (SW) transformation of the electronic Hamiltonians for molecular systems. We demonstrate that by employing Fock-space variants of the SW transformation one can significantly increase the locality of the qubit-mapped similarity transformed Hamiltonians. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.
  arXiv  Detail & Related papers  (2022-11-18T23:06:57Z)
• 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)
• A posteriori corrections to the Iterative Qubit Coupled Cluster method to minimize the use of quantum resources in large-scale calculations [0.0]
  We present a variety of a posteriori corrections to the iQCC energies to reduce the number of iterations to achieve the desired accuracy. We demonstrate the utility and efficiency of our approach numerically on the examples of 10-qubit N$$ molecule, the 24-qubit H$$O stretch, and 56-qubit singlet-triplet gap calculations.
  arXiv  Detail & Related papers  (2020-09-28T20:57:32Z)
• 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)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16: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.