Distributed Quantum Dynamics on Near-Term Quantum Processors

• URL: http://arxiv.org/abs/2502.03542v1
• Date: Wed, 05 Feb 2025 19:01:04 GMT
• Title: Distributed Quantum Dynamics on Near-Term Quantum Processors
• Authors: Vladyslav Bohun, Maxence Grandadam, Maciej Koch-Janusz,
• Abstract summary: We develop and implement a distributed variant of the projected Variational Quantum Dynamics. We employ the wire cutting technique, which can be executed on the existing devices without quantum or classical communication. We demonstrate the full variational training on noisy simulators, and execute and perform the reconstruction on real IBM quantum devices.
• Score: 3.6936647278761283
• License:
• Abstract: Simulations of quantum dynamics are a key application of near term quantum computing, but are hindered by the twin challenges of noise and small device scale, which limit the executable circuit depths and the number of qubits the algorithm can be run on. Towards overcoming these obstacles we develop and implement a distributed variant of the projected Variational Quantum Dynamics which we dub dp-VQD, which allows to simultaneously alleviate circuit depth and width limitations. We employ the wire cutting technique, which can be executed on the existing devices without quantum or classical communication. We demonstrate the full variational training on noisy simulators, and execute and perform the reconstruction on real IBM quantum devices. The algorithm allows to execute Hamiltonian evolution simulations for problem sizes exceeding devices' nominal qubit counts, and to combine multiple small devices in a distributed computation. We test our approach on the Heisenberg and Hubbard model dynamics.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
  This thesis develops two main techniques to reduce the quantum computational resource requirements. The aim is to scale up application sizes on current quantum processors. While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
  arXiv  Detail & Related papers  (2024-03-01T19:36:35Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum Computer [0.40964539027092917]
  We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer. Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits. In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
  arXiv  Detail & Related papers  (2023-12-03T13:56:41Z)
• Overhead-constrained circuit knitting for variational quantum dynamics [0.0]
  We use circuit knitting to partition a large quantum system into smaller subsystems that can each be simulated on a separate device. We show that the same method can be used to reduce the circuit depth by cutting long-ranged gates.
  arXiv  Detail & Related papers  (2023-09-14T17:01:06Z)
• Sequential quantum simulation of spin chains with a single circuit QED device [5.841833052422423]
  Quantum simulation of many-body systems in materials science and chemistry are promising application areas for quantum computers. We show how a single-circuit quantum electrodynamics device can be used to simulate the ground state of a highly-entangled quantum many-body spin chain. We demonstrate that the large state space of the cavity can be used to replace multiple qubits in a qubit-only architecture, and could therefore simplify the design of quantum processors for materials simulation.
  arXiv  Detail & Related papers  (2023-08-30T18:00:03Z)
• 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)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)

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.