Quantum simulation of entanglement dynamics in a quantum processor
- URL: http://arxiv.org/abs/2311.15973v1
- Date: Mon, 27 Nov 2023 16:15:05 GMT
- Title: Quantum simulation of entanglement dynamics in a quantum processor
- Authors: C. Inzulza, S. Saavedra-Pino, F. Albarr\'an-Arriagada, P. Roman, and
J. C. Retamal
- Abstract summary: We implement a five-qubit protocol in IBM quantum processors to get entanglement dynamics in a two qubit system in the presence of an environment.
We focus on measuring, in this superconducting quantum processor, the sudden death and sudden birth of entanglement.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We implement a five-qubit protocol in IBM quantum processors to get
entanglement dynamics in a two qubit system in the presence of an environment.
Specifically, two qubits represent the main system, another two qubits the
environment, and an additional qubit is used as an auxiliary qubit to perform
the quantum entanglement estimation. We focus on measuring, in this
superconducting quantum processor, the sudden death and sudden birth of
entanglement. We obtain the quantum entanglement evolution of the main system
qubits and the environment qubits as the average of $N=10$ independent
experiments in the same quantum device, observing that the noisy nature of
current quantum processors produce a shift on times signaling sudden death o
sudden birth of entanglement. This work takes relevance showing the usefulness
of current noisy quantum devices to test fundamental concepts in quantum
information.
Related papers
- 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) - Measurement-induced entanglement and teleportation on a noisy quantum
processor [105.44548669906976]
We investigate measurement-induced quantum information phases on up to 70 superconducting qubits.
We use a duality mapping, to avoid mid-circuit measurement and access different manifestations of the underlying phases.
Our work demonstrates an approach to realize measurement-induced physics at scales that are at the limits of current NISQ processors.
arXiv Detail & Related papers (2023-03-08T18:41:53Z) - 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) - Quantifying information scrambling via Classical Shadow Tomography on
Programmable Quantum Simulators [0.0]
We develop techniques to probe the dynamics of quantum information, and implement them experimentally on an IBM superconducting quantum processor.
We identify two unambiguous signatures of quantum information scrambling, neither of which can be mimicked by dissipative processes.
We measure both signatures, and support our results with numerical simulations of the quantum system.
arXiv Detail & Related papers (2022-02-10T16:36:52Z) - Quantum Memristors with Quantum Computers [0.0]
We propose the encoding of memristive quantum dynamics on a digital quantum computer.
We numerically test our proposal in an IBM quantum simulator with 32 qubits.
arXiv Detail & Related papers (2021-12-29T17:18:53Z) - Perturbative quantum simulation [2.309018557701645]
We introduce perturbative quantum simulation, which combines the complementary strengths of the two approaches.
The use of a quantum processor eliminates the need to identify a solvable unperturbed Hamiltonian.
We numerically benchmark the method for interacting bosons, fermions, and quantum spins in different topologies.
arXiv Detail & Related papers (2021-06-10T17:38:25Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - 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) - Quantum Circuits for Collective Amplitude Damping in Two-Qubit Systems [0.0]
We investigate formulations of the collective quantum noises represented as quantum circuits.
We demonstrate digital quantum simulations of the collective amplitude damping by examining six different initial conditions.
These results pave the way for establishing systematic approaches to control the quantum noises and designing large-scale quantum computers.
arXiv Detail & Related papers (2020-12-04T05:17:56Z)
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.