Divide-and-Conquer Simulation of Open Quantum Systems
- URL: http://arxiv.org/abs/2505.01623v1
- Date: Fri, 02 May 2025 23:09:55 GMT
- Title: Divide-and-Conquer Simulation of Open Quantum Systems
- Authors: Thiago Melo D. Azevedo, Caio Almeida, Pedro Linck, Adenilton J. da Silva, Nadja K. Bernardes,
- Abstract summary: We describe a divide-and-conquer strategy for preparing mixed states to combine the output of each Kraus operator dilation.<n>We present a proof-of-concept simulation of the Fenna-Matthews-Olson dynamic on current quantum hardware.
- Score: 0.7270112855088837
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: One of the promises of quantum computing is to simulate physical systems efficiently. However, the simulation of open quantum systems - where interactions with the environment play a crucial role - remains challenging for quantum computing, as it is impossible to implement deterministically non-unitary operators on a quantum computer without auxiliary qubits. The Stinespring dilation can simulate an open dynamic but requires a high circuit depth, which is impractical for NISQ devices. An alternative approach is parallel probabilistic block-encoding methods, such as the Sz.-Nagy and Singular Value Decomposition dilations. These methods result in shallower circuits but are hybrid methods, and we do not simulate the quantum dynamic on the quantum computer. In this work, we describe a divide-and-conquer strategy for preparing mixed states to combine the output of each Kraus operator dilation and obtain the complete dynamic on quantum hardware with a lower circuit depth. The work also introduces a balanced strategy that groups the original Kraus operators into an expanded operator, leading to a trade-off between circuit depth, CNOT count, and number of qubits. We perform a computational analysis to demonstrate the advantages of the new method and present a proof-of-concept simulation of the Fenna-Matthews-Olson dynamic on current quantum hardware.
Related papers
- VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
arXiv Detail & Related papers (2025-06-12T01:38:15Z) - Simulating quantum circuits with restricted quantum computers [0.0]
This thesis is dedicated to the simulation of nonlocal quantum computation using local quantum operations.<n>We characterize the optimal simulation overhead for a broad range of practically relevant nonlocal states and channels.<n>We also investigate the utility of classical communication between the local parties.
arXiv Detail & Related papers (2025-03-27T17:59:45Z) - 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) - Quantum Equilibrium Propagation for efficient training of quantum systems based on Onsager reciprocity [0.0]
Equilibrium propagation (EP) is a procedure that has been introduced and applied to classical energy-based models which relax to an equilibrium.
Here, we show a direct connection between EP and Onsager reciprocity and exploit this to derive a quantum version of EP.
This can be used to optimize loss functions that depend on the expectation values of observables of an arbitrary quantum system.
arXiv Detail & Related papers (2024-06-10T17:22:09Z) - Parallelizing quantum simulation with decision diagrams [2.5999037208435705]
Classical computers face a critical obstacle in simulating quantum algorithms.
Quantum states reside in a Hilbert space whose size grows exponentially to the number of subsystems, i.e., qubits.
This work explores several strategies for parallelizing decision diagram operations, specifically for quantum simulations.
arXiv Detail & Related papers (2023-12-04T02:00:24Z) - 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) - Quantum Simulation on Noisy Superconducting Quantum Computers [0.0]
Quantum simulation is a potentially powerful application of quantum computing.
There is little introductory literature or demonstrations of the topic at a graduate or undergraduate student level.
This artificially raises the barrier to entry into the field which already has a limited workforce.
arXiv Detail & Related papers (2022-09-06T19:44:18Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - 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) - 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) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum
Computer Using Inherent Qubit Decoherence [53.20999552522241]
We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems.
We present three methods for implementing the thermal relaxation.
We find excellent agreement between our results, experimental data, and the theoretical prediction.
arXiv Detail & Related papers (2020-01-03T11:48:11Z)
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.