Fermion Sampling: A Robust Quantum Computational Advantage Scheme Using Fermionic Linear Optics and Magic Input States

被引:21
作者
Oszmaniec, Michal [1 ]
Dangniam, Ninnat [1 ]
Morales, Mauro E. S. [2 ]
Zimboras, Zoltan [3 ,4 ,5 ]
机构
[1] Polish Acad Sci, Ctr Theoret Phys, Al Lotnikow 32-46, PL-02668 Warsaw, Poland
[2] Univ Technol Sydney, Ctr Quantum Computat & Commun Technol, Ctr Quantum Software & Informat, Sydney, NSW 2007, Australia
[3] Wigner Res Ctr Phys, H-1121 Budapest, Hungary
[4] MTA BME Lendulet Quantum Informat Theory Res Grp, Budapest, Hungary
[5] Budapest Univ Technol & Econ, Math Inst, H-1111 Budapest, Hungary
来源
PRX QUANTUM | 2022年 / 3卷 / 02期
关键词
CLASSICAL SIMULATION; CIRCUITS; POLYNOMIALS; SUPREMACY; BOUNDS; HARD;
D O I
10.1103/PRXQuantum.3.020328
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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 analog 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. Using low-dimensional continuous symmetry groups that underpin these classes of quantum circuits, we prove anticoncentration and robust average-case hardness of computation of output probabilities probabilities. Taken together, these findings provide hardness guarantees comparable to the paradigm of random circuit sampling and boson sampling, the leading candidates for attaining quantum computational advantage. Our scheme is experimentally feasible. FLO circuits are relevant for quantum chemistry and many-body physics, and have been successfully implemented in superconducting architectures. We also argue that due to the structured nature of FLO circuits, they can be efficiently certified using resources scaling polynomially with the system size, with partial trust in the quantum device.
引用
收藏
页数:54
相关论文
共 118 条
[91]   Universal Extensions of Restricted Classes of Quantum Operations [J].
Oszmaniec, Michal ;
Zimboras, Zoltan .
PHYSICAL REVIEW LETTERS, 2017, 119 (22)
[92]   Classical simulation of fermionic linear optics augmented with noisy ancillas [J].
Oszmaniec, Michal ;
Gutt, Jan ;
Kus, Marek .
PHYSICAL REVIEW A, 2014, 90 (02)
[93]   Fraction of isospectral states exhibiting quantum correlations [J].
Oszmaniec, Michal ;
Kus, Marek .
PHYSICAL REVIEW A, 2014, 90 (01)
[94]   Universal framework for entanglement detection [J].
Oszmaniec, Michal ;
Kus, Marek .
PHYSICAL REVIEW A, 2013, 88 (05)
[95]   From estimation of quantum probabilities to simulation of quantum circuits [J].
Pashayan, Hakop ;
Bartlett, Stephen D. ;
Gross, David .
QUANTUM, 2020, 4
[96]  
Paturi R., 1992, Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, P468, DOI 10.1145/129712.129758
[97]   Quantum Computing in the NISQ era and beyond [J].
Preskill, John .
QUANTUM, 2018, 2
[98]   Sufficient Conditions for Efficient Classical Simulation of Quantum Optics [J].
Rahimi-Keshari, Saleh ;
Ralph, Timothy C. ;
Caves, Carlton M. .
PHYSICAL REVIEW X, 2016, 6 (02)
[99]   Direct characterization of linear-optical networks [J].
Rahimi-Keshari, Saleh ;
Broome, Matthew A. ;
Fickler, Robert ;
Fedrizzi, Alessandro ;
Ralph, Timothy C. ;
White, Andrew G. .
OPTICS EXPRESS, 2013, 21 (11) :13450-13458
[100]   Quantum process tomography with coherent states [J].
Rahimi-Keshari, Saleh ;
Scherer, Artur ;
Mann, Ady ;
Rezakhani, A. T. ;
Lvovsky, A. I. ;
Sanders, Barry C. .
NEW JOURNAL OF PHYSICS, 2011, 13