Entanglement spectroscopy with a depth-two quantum circuit

Abstract

Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing the qubit count. Here, we exploit this trade-off for an application called entanglement spectroscopy, where one computes the entanglement of a state $|\psi ⟩$ on systems $AB$ by evaluating the Rényi entropy of the reduced state ${\rho }_A={\mathrm{Tr}}_B(|\psi ⟩⟨\psi |)$. For a $k$-qubit state $\rho (k)$, the Rényi entropy of order $n$ is computed via $\mathrm{Tr}(\rho (k{)}^n)$, with the complexity growing exponentially in $k$ for classical computers. Johri, Steiger, and Troyer [PRB 96, 195136 (2017)] introduced a quantum algorithm that requires $n$ copies of $|\psi ⟩$ and whose depth scales linearly in $k\ast n$. Here, we present a quantum algorithm requiring twice the qubit resources ($2n$ copies of $|\psi ⟩$) but with a depth that is independent of both $k$ and $n$. Surprisingly this depth is only two gates. Our numerical simulations show that this short depth leads to an increased robustness to noise.

10 pages, 6 figures

References in corpus (21)

• Quantum entanglement
• Quantum Computing in the NISQ era and beyond
• Surface codes: Towards practical large-scale quantum computation
• The theory of variational hybrid quantum-classical algorithms
• Entanglement Spectrum as a Generalization of Entanglement Entropy: Identification of Topological Order in Non-Abelian Fractional Quantum Hall Effect States
• Error mitigation for short-depth quantum circuits
• Measuring entanglement entropy through the interference of quantum many-body twins
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Measuring Renyi Entanglement Entropy with Quantum Monte Carlo
• Bipartite Fluctuations as a Probe of Many-Body Entanglement
• Learning the quantum algorithm for state overlap
• The SWAP test and the Hong-Ou-Mandel effect are equivalent
• Quantum computing and the entanglement frontier
• Quantum circuits cannot control unknown operations
• Parallelizing Quantum Circuits
• Measurement Protocol for the Entanglement Spectrum of Cold Atoms
• Measuring the Renyi entropy of a two-site Fermi-Hubbard model on a trapped ion quantum computer
• Entanglement spectroscopy on a quantum computer
• Quantum Computing with black-box Subroutines
• Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code
• Quantifying Coherence and Entanglement via Simple Measurements

Cited by in corpus (40)

• Hybrid quantum-classical algorithms and quantum error mitigation
• Virtual Distillation for Quantum Error Mitigation
• Noise Resilience of Variational Quantum Compiling
• Variational Quantum State Eigensolver
• Methodology for replacing indirect measurements with direct measurements
• Computable and operationally meaningful multipartite entanglement measures
• Quantum circuits for measuring weak values, Kirkwood--Dirac quasiprobability distributions, and state spectra
• Quantum Singular Value Decomposer
• Quantum Variational Learning of the Entanglement Hamiltonian
• Quantum enhancements for deep reinforcement learning in large spaces
• Determining the proton content with a quantum computer
• Quantum unary approach to option pricing
• Modelling quantum light-matter interactions in waveguide-QED with retardation and a time-delayed feedback: matrix product states versus a space-discretized waveguide model
• Qubit-efficient entanglement spectroscopy using qubit resets
• Measuring Quantum Entropy
• Estimating distinguishability measures on quantum computers
• Quantum algorithms for estimating quantum entropies
• Multivariate trace estimation in constant quantum depth
• Quantum Mixed State Compiling
• Entangled Datasets for Quantum Machine Learning
• Quantum Phase Processing and its Applications in Estimating Phase and Entropies
• Variational quantum algorithms to estimate rank, quantum entropies, fidelity and Fisher information via purity minimization
• Quantum Neural Estimation of Entropies
• Variational quantum Gibbs state preparation with a truncated Taylor series
• On exploring the potential of quantum auto-encoder for learning quantum systems
• Ancilla-free continuous-variable SWAP test
• Ancilla-Error-Transparent Controlled Beam Splitter Gate
• In the shadow of the Hadamard test: Using the garbage state for good and further modifications
• Qubit-efficient exponential suppression of errors
• The topology of data hides in quantum thermal states
• Quantum topological data analysis via the estimation of the density of states
• High-fidelity dimer excitations using quantum hardware
• Efficient quantum algorithms for testing symmetries of open quantum systems
• Parallel Quantum Signal Processing Via Polynomial Factorization
• Resource-efficient algorithm for estimating the trace of quantum state powers
• Experimental measurement and a physical interpretation of quantum shadow enumerators
• More Practical and Adaptive Algorithms for Online Quantum State Learning
• Explicit Formulas for Estimating Trace of Reduced Density Matrix Powers via Single-Circuit Measurement Probabilities
• Detecting entanglement from few partial transpose moments and their decay via weight enumerators
• Performance Guarantees for Quantum Neural Estimation of Entropies