Optimal two-qubit gate for generation of random bipartite entanglement

Abstract

We numerically study protocols consisting of repeated applications of two qubit gates used for generating random pure states. A necessary number of steps needed in order to generate states displaying bipartite entanglement typical of random states is obtained. For generic two qubit entangling gate the decay rate of purity is found to scale as $\sim n$ and therefore of order $\sim n^2$ steps are necessary to reach random bipartite entanglement. We also numerically identify the optimal two qubit gate for which the convergence is the fastest. Perhaps surprisingly, applying the same good two qubit gate in addition to a random single qubit rotations at each step leads to a faster generation of entanglement than applying a random two qubit transformation at each step.

9 pages, 9 PS figures; published version

References in corpus (38)

• Efficient classical simulation of slightly entangled quantum computations
• Random Matrix Theories in Quantum Physics: Common Concepts
• Average Entropy of a Subsystem
• Time Optimal Control in Spin Systems
• On the role of entanglement in quantum computational speed-up
• Characterizing Entanglement
• Optimal Creation of Entanglement Using a Two--Qubit Gate
• Induced measures in the space of mixed quantum states
• Aspects of generic entanglement
• Randomizing quantum states: Constructions and applications
• Entanglement Entropy dynamics in Heisenberg chains
• A universal quantum circuit for two-qubit transformations with three CNOT gates
• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• Average Entropy of a Subsystem
• Superdense coding of quantum states
• Testing statistical bounds on entanglement using quantum chaos
• Is efficiency of classical simulations of quantum dynamics related to integrability?
• Remote preparation of quantum states
• Efficient Generation of Generic Entanglement
• Dynamical aspects of quantum entanglement for weakly coupled kicked tops
• Entangling power of the quantum baker's map
• Efficient Quantum Computing of Complex Dynamics
• Convergence Conditions for Random Quantum Circuits
• Semiclassical time-evolution of the reduced density matrix and dynamically assisted generation of entanglement for bipartite quantum systems
• Fidelity and Purity Decay in Weakly Coupled Composite Systems
• Entanglement dynamics in chaotic systems
• Probability density function characterization of multipartite entanglement
• Saturation of the production of quantum entanglement between weakly coupled mapping systems in strongly chaotic region
• Entanglement of random vectors
• Global entangling properties of the coupled kicked tops
• Bounds on entanglement in qudit subsystems
• Decoherence of spin echoes
• Distribution of bipartite entanglement for random pure states
• Entanglement Generation of Nearly-Random Operators
• Quantum Computing of Quantum Chaos in the Kicked Rotator Model
• A random matrix approach to decoherence
• Distribution of G-concurrence of random pure states
• Optimal superdense coding of entangled states

Cited by in corpus (33)

• Random Quantum Circuits are Approximate 2-designs
• Exact dynamics in dual-unitary quantum circuits
• Convergence rates for arbitrary statistical moments of random quantum circuits
• Quantum chaos in the Brownian SYK model with large finite $N$: OTOCs and tripartite information
• A Random Unitary Circuit Model for Black Hole Evaporation
• Exact convergence times for generation of random bipartite entanglement
• Noisy Coupled Qubits: Operator Spreading and the Fredrickson-Andersen Model
• Simulating hydrodynamics on noisy intermediate-scale quantum devices with random circuits
• Subsystem dynamics under random Hamiltonian evolution
• Markovian Entanglement Dynamics under Locally Scrambled Quantum Evolution
• Entanglement in random pure states: Spectral density and average von Neumann entropy
• Efficiency of Producing Random Unitary Matrices with Quantum Circuits
• Fastest local entanglement scrambler, multistage thermalization, and a non-Hermitian phantom
• Parameters of Pseudo-Random Quantum Circuits
• Relaxation due to random collisions with a many-qudit environment
• Entanglement dynamics and relaxation in a few qubit system interacting with random collisions
• Ensembles of physical states and random quantum circuits on graphs
• Two-step phantom relaxation of out-of-time-ordered correlations in random circuits
• Quantum pseudo-randomness from cluster-state quantum computation
• Generic features of the dynamics of complex open quantum systems: Statistical approach based on averages over the unitary group
• Scrambling via Braiding of Nonabelions
• Observation of entanglement negativity transition of pseudo-random mixed states
• Quantum simulation using noisy unitary circuits and measurements
• Pseudo-randomness and Learning in Quantum Computation
• Designs from Local Random Quantum Circuits with SU(d) Symmetry
• Random Matrix Ensembles For Many-Body Quantum Systems
• Quantum circuit for three-qubit random states
• Generation of Pseudo-Random Quantum States on Actual Quantum Processors
• Effective field theory of random quantum circuits
• Efficient generation of random multipartite entangled states using time optimal unitary operations
• Pseudo-Random Circuits from Clifford Plus T-Gates
• Random unitary matrices associated to a graph
• More global randomness from less-random local gates