Computational Power of Clifford and Ising Quantum Computers
Sawyer Dobson, Zhenghan Wang
Abstract
We extend the efficient classical simulation of Ising quantum computers from braidings to measurements. We investigate several different definitions of efficient Clifford quantum computation by varying the power of the circuit generator. In case the circuit generator can see the entire input, we give a detailed proof that efficient simulation of classical computation would imply the separation of complexity classes P and PSPACE. If the circuit generator sees only the input length, we prove that Clifford quantum computers decide what we call affine languages.
Create a lesson
Related papers
High-temperature Gibbs states are uniformly Markovian and trivial
Andrew D. Kim, Tai Hsuan Yang, Jong Yeon Lee
Query-Optimal Quantum Minimum Finding from Numerical Estimators
Egil Bae
Fast, in-place, and ancilla-free quantum algorithms for integer multiplication and inversion
David Halpenny, Adithya Sireesh, Petros Wallden
High-Accuracy Neural-Network Quantum States via Randomized Real-Time Dynamics
John M. Martyn, Rod Rofougaran, Samuel Stein et al.
End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System
Mohsen Bagherimehrab, Daniyaal Farooqi, Gavin K. Brennen et al.
Classically Trained Quantum Generative Models with Shared Training and Fine Tuning for Quantum Matter
Mario Herrero-Gonzalez, Elham Kashefi, Mina Doosti