Quantum complexity theory

The purported power of quantum computers and our excitement over studying quantum systems come from our belief that large physically realistic quantum systems cannot be efficiently simulated on classical computers. Our group is interested in classifying which quantum states are hard to simulate on classical computers and which ones are easy. This applies to all kinds of quantum states of qubits, bosons, or fermions, including thermal states, steady states, states following time evolution under a Hamiltonian, a Lindbladian, or a circuit, subject to noise and/or mid-circuit measurements, etc... Of particular interest are transitions between easiness and hardness.
Sample of Related Publications
Entanglement and Circuit Complexity in Finite-Depth Random Linear Optical Networks
, , arXiv:2604.14277, (2026)Shou et al_2026_Entanglement and circuit complexity in finite-depth random linear optical.pdfNoise-Induced Contraction of MPO Truncation Errors in Noisy Random Circuits and Lindbladian Dynamics
, , arXiv:2603.20400, (2026)Wei et al_2026_Noise-induced contraction of MPO truncation errors in noisy random circuits and.pdfMeasurement-Induced Entanglement in Noisy 2D Random Clifford Circuits
, , arXiv:2510.12743, (2025)Wei et al_2025_Measurement-induced entanglement in noisy 2D random Clifford circuits.pdfDynamical Complexity of Non-Gaussian Many-Body Systems with Dissipation
, , Phys. Rev. Lett., 135, (2025)rd56-b8tc.pdfSupplemental-2.pdfThe Second Moment of Hafnians in Gaussian Boson Sampling
, , Phys. Rev. A, 111, (2025)PhysRevA.111.042412.pdfTransition of Anticoncentration in Gaussian Boson Sampling
, , Phys. Rev. Lett., 134, (2025)PhysRevLett.134.140601.pdfA Sharp Phase Transition in Linear Cross-Entropy Benchmarking
, , arXiv:2305.04954 [cond-mat, physics:quant-ph], (2023)Ware et al_2023_A sharp phase transition in linear cross-entropy benchmarking.pdfComplexity Phase Transitions Generated by Entanglement
, , Phys. Rev. Lett., 131, (2023)Ghosh et al_2022_Sharp complexity phase transitions generated by entanglement.pdfSimulation Complexity of Many-Body Localized Systems
, , arXiv:2205.12967, (2022)2205.12967.pdfMonitoring-induced entanglement entropy and sampling complexity
, , Physical Review Research, 4, (2022)PhysRevResearch.4.L032021-combined.pdfTight bounds on the convergence of noisy random circuits to the uniform distribution
, , PRX Quantum, 3, (2022)PRXQuantum.3.040329.pdfImportance of the Spectral gap in Estimating Ground-State Energies
, , PRX Quantum, 3, (2022)Deshpande et al. - 2022 - Importance of the Spectral gap in Estimating Groun.pdfComplexity of Fermionic Dissipative Interactions and Applications to Quantum Computing
, , Prx Quantum, 2, (2021)shtanko21.pdfClassical Models of Entanglement in Monitored Random Circuits
, , arXiv:2004.06736, (2020)2004.06736.pdfComplexity phase diagram for interacting and long-range bosonic Hamiltonians
, , Phys. Rev. Lett., 129, 8, (2019)maskara22.pdfmaskara22supp.pdfDynamical Phase Transitions in Sampling Complexity
, , Physical Review Letters, 121, (2018)deshpande18supp.pdfdeshpande18.pdfSolvable family of driven-dissipative many-body systems
, , Physical Review Letters, 119, (2017)foss-feig17.pdffoss-feig17supp.pdfExact sampling hardness of Ising spin models
, , Physical Review A, 96, (2017)fefferman17.pdf