Dynamically localized systems: entanglement exponential sensitivity and efficient quantum simulations

Abstract

We study the pairwise entanglement present in a quantum computer that simulates a dynamically localized system. We show that the concurrence is exponentially sensitive to changes in the Hamiltonian of the simulated system. Moreover, concurrence is exponentially sensitive to the ``logic'' position of the qubits chosen. These sensitivities could be experimentally checked efficiently by means of quantum simulations with less than ten qubits. We also show that the feasibility of efficient quantum simulations is deeply connected to the dynamical regime of the simulated system.

5 pages, 6 figures

References in corpus (9)

• Efficient classical simulation of slightly entangled quantum computations
• Entangling power of the quantum baker's map
• Theory of quantum Loschmidt echoes
• Dynamics of entanglement in quantum computers with imperfections
• Dynamical localization simulated on a few qubits quantum computer
• Entanglement versus relaxation and decoherence in a quantum algorithm for quantum chaos
• Testing integrability with a single bit of quantum information
• Entanglement Echoes in Quantum Computation
• Dynamical localization, measurements and quantum computing

Cited by in corpus (8)

• Quantum entanglement
• Quantum Simulation
• Many body localization in Heisenberg XXZ magnet in a random field
• Quantum computers as universal quantum simulators: state-of-art and perspectives
• Entanglement Across a Transition to Quantum Chaos
• Entanglement of localized states
• Fractal Fidelity as a signature of Quantum Chaos
• Dynamical localization simulated on actual quantum hardware