Entanglement Trajectory and its Boundary

Abstract

In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and representing the dominant eigenvalue and von Neumann entropy on a graph, creating an "entanglement trajectory." To establish the trajectory's boundaries, we employ random matrix theory. Through the examination of examples such as quantum adiabatic computation, the Grover algorithm, and the Shor algorithm, we demonstrate that the entanglement trajectory remains within the established boundaries, exhibiting unique characteristics for each example. Moreover, we show that these boundaries and features can be extended to trajectories defined by alternative entropy measures. The entanglement trajectory serves as an invariant property of a quantum system, maintaining consistency across varying situations and definitions of entanglement. Numerical simulations accompanying this research are available via open access.

References in corpus (34)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Efficient classical simulation of slightly entangled quantum computations
• Entanglement Spectrum as a Generalization of Entanglement Entropy: Identification of Topological Order in Non-Abelian Fractional Quantum Hall Effect States
• Average Entropy of a Subsystem
• Adiabatic Quantum Computing
• On Orthogonal and Symplectic Matrix Ensembles
• On the role of entanglement in quantum computational speed-up
• Semiclassical Fourier Transform for Quantum Computation
• Induced measures in the space of mixed quantum states
• Entanglement spectrum in one-dimensional systems
• Aspects of generic entanglement
• Entanglement spectrum and boundary theories with projected entangled-pair states
• Most quantum states are too entangled to be useful as computational resources
• Average Entropy of a Subsystem
• Introduction to Random Matrices - Theory and Practice
• Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices
• Statistical properties of random density matrices
• Disentangling Entanglement Spectra of Fractional Quantum Hall States on Torus Geometries
• Qibo: a framework for quantum simulation with hardware acceleration
• Distribution of the largest eigenvalue for real Wishart and Gaussian random matrices and a simple approximation for the Tracy-Widom distribution
• Universality of Entanglement and Quantum Computation Complexity
• On Rényi and Tsallis entropies and divergences for exponential families
• A closed-form expression for the Sharma-Mittal entropy of exponential families
• Does Adiabatic Quantum Optimization Truly Fail for NP-complete problems?
• Exponential complexity of an adiabatic algorithm for an NP-complete problem
• Asymptotics of random density matrices
• Subsystem dynamics under random Hamiltonian evolution
• Quantum simulation with just-in-time compilation
• Entanglement Simulations of Shor's Algorithm
• Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end
• The Prime state and its quantum relatives
• Entanglement gap, corners, and symmetry breaking
• Spectral density of the non-central correlated Wishart ensembles
• Bulk-edge correspondence in the Haldane phase of the bilinear-biquadratic spin-1 Hamiltonian