Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
arXiv:2012.15825 · doi:10.1103/PRXQuantum.3.020328
Abstract
Fermionic Linear Optics (FLO) is a restricted model of quantum computation which in its original form is known to be efficiently classically simulable. We show that, when initialized with suitable input states, FLO circuits can be used to demonstrate quantum computational advantage with strong hardness guarantees. Based on this, we propose a quantum advantage scheme which is a fermionic analogue of Boson Sampling: Fermion Sampling with magic input states. We consider in parallel two classes of circuits: particle-number conserving (passive) FLO and active FLO that preserves only fermionic parity and is closely related to Matchgate circuits introduced by Valiant. Mathematically, these classes of circuits can be understood as fermionic representations of the Lie groups and . This observation allows us to prove our main technical results. We first show anticoncentration for probabilities in random FLO circuits of both kind. Moreover, we prove robust average-case hardness of computation of probabilities. To achieve this, we adapt the worst-to-average-case reduction based on Cayley transform, introduced recently by Movassagh, to representations of low-dimensional Lie groups. Taken together, these findings provide hardness guarantees comparable to the paradigm of Random Circuit Sampling. Importantly, our scheme has also a potential for experimental realization. Both passive and active FLO circuits are relevant for quantum chemistry and many-body physics and have been already implemented in proof-of-principle experiments with superconducting qubit architectures. Preparation of the desired quantum input states can be obtained by a simple quantum circuit acting independently on disjoint blocks of four qubits and using 3 entangling gates per block. We also argue that due to the structured nature of FLO circuits, they can be efficiently certified.
arXiv comment65 pages, 13 figures, 1 table, v2: improved discussion and narrative, numerics about anticoncentration added, references updated, comments and suggestions are welcome
References in corpus (73)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum computational advantage using photons
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Characterizing Quantum Supremacy in Near-Term Devices
- Strong quantum computational advantage using a superconducting quantum processor
- Fermionic quantum computation
- Quantum Computational Supremacy
- Hartree-Fock on a superconducting qubit quantum computer
- Boson sampling with 20 input photons in 60-mode interferometers at state spaces
- Gaussian Boson Sampling
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Quantum advantage with shallow circuits
- Boson Sampling for Molecular Vibronic Spectra
- Quantum certification and benchmarking
- Classical simulation of noninteracting-fermion quantum circuits
- Random Quantum Circuits are Approximate 2-designs
- Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
- Boson Sampling from Gaussian States
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
- Natural two-qubit gate for quantum computation using the XY interaction
- Matchgates and classical simulation of quantum circuits
- Electron quantum optics in ballistic chiral conductors
- Charge detection enables free-electron quantum computation
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- Quantum Sampling Problems, BosonSampling and Quantum Supremacy
- Instantaneous Quantum Computation
- Quantum algorithms to simulate many-body physics of correlated fermions
- Molecular Docking with Gaussian Boson Sampling
- Efficient classical simulation of random shallow 2D quantum circuits
- Complete Characterization of Quantum-Optical Processes
- Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
- Using Gaussian Boson Sampling to Find Dense Subgraphs
- Approximate unitary -designs by short random quantum circuits using nearest-neighbor and long-range gates
- Direct characterization of linear-optical networks
- Architectures for quantum simulation showing a quantum speedup
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- A quantum hardware-induced graph kernel based on Gaussian Boson Sampling
- Quantum process tomography with coherent states
- Fermionic Linear Optics and Matchgates
- Vibronic Boson Sampling: Generalized Gaussian Boson Sampling for Molecular Vibronic Spectra at Finite Temperature
- Efficient classical simulation of matchgate circuits with generalized inputs and measurements
- Quantum approximate optimization with Gaussian boson sampling
- Anticoncentration theorems for schemes showing a quantum speedup
- From estimation of quantum probabilities to simulation of quantum circuits
- Hardness of classically sampling one clean qubit model with constant total variation distance error
- Sample complexity of device-independently certified "quantum supremacy"
- Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
- Quantum advantage of unitary Clifford circuits with magic state inputs
- The Power of Noisy Fermionic Quantum Computation
- All pure fermionic non-Gaussian states are magic states for matchgate computations
- Noise and the frontier of quantum supremacy
- A Dynamic Systems Approach to Fermions and Their Relation to Spins
- Efficient verification of Boson Sampling
- Extending matchgates into universal quantum computation
- Universal extensions of restricted classes of quantum operations
- Classical simulation of fermionic linear optics augmented with noisy ancillas
- Quantum supremacy and random circuits
- A universal framework for entanglement detection
- `Classical' quantum states
- Quantum simulation of partially distinguishable boson sampling
- The complexity of simulating constant-depth BosonSampling
- Fraction of isospectral states exhibiting quantum correlations
- Computational power of matchgates with supplementary resources
- Geometries for universal quantum computation with matchgates
- Boson Sampling is Robust to Small Errors in the Network Matrix
- Classical capacity of fermionic product channels
- Complexity of full counting statistics of free quantum particles in product states
- Computational complexity of exterior products and multi-particle amplitudes of non-interacting fermions in entangled states
- Applications of differential geometry and representation theory to description of quantum correlations
Cited by in corpus (33)
- Barren Plateaus in Variational Quantum Computing
- Computational advantage of quantum random sampling
- Noise and the frontier of quantum supremacy
- Quantum Deep Hedging
- Spoofing cross entropy measure in boson sampling
- Hilbert space delocalization under random unitary circuits
- Group-theoretic error mitigation enabled by classical shadows and symmetries
- Lie-algebraic classical simulations for quantum computing
- Computing exact moments of local random quantum circuits via tensor networks
- Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
- Anti-Hong-Ou-Mandel interference by coherent perfect absorption of entangled photons
- Quantum Algorithms for Inverse Participation Ratio Estimation in multi-qubit and multi-qudit systems
- Improved simulation of quantum circuits dominated by free fermionic operations
- Free-fermion Page Curve: Canonical Typicality and Dynamical Emergence
- Characterization of variational quantum algorithms using free fermions
- The non-stabilizerness of fermionic Gaussian states
- Fermionic Magic Resources of Quantum Many-Body Systems
- Error bounds for Lie Group representations in quantum mechanics
- Scalable quantum control and non-abelian anyon creation in the Kitaev honeycomb model
- Optimal trace-distance bounds for free-fermionic states: Testing and improved tomography
- A Simple and Efficient Joint Measurement Strategy for Estimating Fermionic Observables and Hamiltonians
- Exact spectral gaps of random one-dimensional quantum circuits
- Architectures and random properties of symplectic quantum circuits
- High performance Boson Sampling simulation via data-flow engines
- Analyzing the free states of one quantum resource theory as resource states of another
- Mott Transition and Volume Law Entanglement with Neural Quantum States
- Optimal Fermionic Joint Measurements for Estimating Non-Commuting Majorana Observables
- Fermion Sampling Made More Efficient
- Mixed symmetries of S_n: immanants in the sampling of U(d) submatrices
- Boson-fermion complementarity in a linear interferometer: An identity relating the determinant and permanent of a matrix
- Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
- Moments of Quantum Channel Ensembles
- Polynomial speedup in Torontonian calculation by a scalable recursive algorithm