Quantum circuits for maximally entangled states

Abstract

We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and minimize their depth. Furthermore, we find that most of the provided circuits obey majorization relations for every partition of the system, and at every step of the quantum computation. The rational for our approach is to benchmark quantum computers with maximal useful entanglement, which can be used to implement multipartite quantum protocols.

arXiv comment13 pages, 17 figures

References in corpus (37)

• Elementary gates for quantum computation
• Probing many-body dynamics on a 51-atom quantum simulator
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• How to share a quantum secret
• Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
• Symmetric Informationally Complete Quantum Measurements
• Multi-party entanglement in graph states
• Experimental Quantum State Tomography of Optical Fields and Ultrafast Statistical Sampling
• Unknown Quantum States and Operations, a Bayesian View
• Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
• Demonstration of a small programmable quantum computer with atomic qubits
• On the role of entanglement in quantum computational speed-up
• Quantum spin dynamics and entanglement generation with hundreds of trapped ions
• Characterizing Quantum Gates via Randomized Benchmarking
• Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• Self-Consistent Quantum Process Tomography
• Tight informationally complete quantum measurements
• Absolute Maximal Entanglement and Quantum Secret Sharing
• Experimental demonstration of fault-tolerant state preparation with superconducting qubits
• Bell Inequalities for Graph States
• How entangled can two couples get?
• Maximally multipartite entangled states
• Multi-Qubit Systems: Highly Entangled States and Entanglement Distribution
• Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices
• Genuinely multipartite entangled states and orthogonal arrays
• Absolutely maximally entangled states of seven qubits do not exist
• Three Qubit Randomized Benchmarking
• Experimental test of Mermin inequalities on a 5-qubit quantum computer
• Exact Ising model simulation on a quantum computer
• Quantum Error Correcting Codes Using Qudit Graph States
• Entanglement and quantum combinatorial designs
• Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
• Five measurement bases determine pure quantum states on any dimension
• Optimal preparation of graph states
• Entanglement in eight-qubit graph states
• The Majorization Arrow in Quantum Algorithm Design

Cited by in corpus (27)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Advances in High Dimensional Quantum Entanglement
• Quantum Indistinguishability by Path Identity: The awakening of a sleeping beauty
• Quantum Singular Value Decomposer
• Scalable Benchmarks for Gate-Based Quantum Computers
• Learning Interpretable Representations of Entanglement in Quantum Optics Experiments using Deep Generative Models
• Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer
• Deterministic generation of qudit photonic graph states from quantum emitters
• $k$-uniform mixed states
• Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer
• Entanglement Diagnostics for Efficient Quantum Computation
• The principle of majorization: application to random quantum circuits
• Scalable Bell inequalities for graph states of arbitrary prime local dimension and self-testing
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• Tensor network decompositions for absolutely maximally entangled states
• Geometric properties of evolutionary graph states and their detection on a quantum computer
• Platonic Entanglement
• Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
• Methods for Classically Simulating Noisy Networked Quantum Architectures
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
• Limitation of maximally entangled probes for single-shot distinguishability of unitaries
• Quantum Circuits for High-Dimensional Absolutely Maximally Entangled States
• Honest-binding quantum bit commitment from separable operations
• Synthesis and upper bound of Schmidt rank of the bipartite controlled-unitary gates
• Gauge and diffeomorphism invariance from quantum information principles
• Absolutely maximally entangled pure states of multipartite quantum systems
• Studies of properties of bipartite graphs with quantum programming