Quantum Circuits That Can Be Simulated Classically in Polynomial Time
From MaRDI portal
Recommendations
- Quantum computers that can be simulated classically in polynomial time
- Deterministic polynomial-time quantum algorithms for Simon's problem
- scientific article; zbMATH DE number 1303028
- Classical simulation of quantum circuits by half Gauss sums
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Matchgates and classical simulation of quantum circuits
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Classical simulation complexity of quantum machines.
Cited in
(72)- Holographic algorithms: the power of dimensionality resolved
- On blockwise symmetric matchgate signatures and higher domain \#CSP
- Complexity classification of the six-vertex model
- Deterministic polynomial-time quantum algorithms for Simon's problem
- Clifford gates in the Holant framework
- Holographic algorithms by Fibonacci gates
- Holographic algorithms without matchgates
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
- Boundary theories of critical matchgate tensor networks
- Evaluations of Tutte polynomials of regular graphs
- Counting degree-constrained subgraphs and orientations
- Classically simulating quantum circuits with local depolarizing noise
- Free fermions behind the disguise
- Valiant's holant theorem and matchgate tensors
- Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits
- On the satisfiability of quantum circuits of small treewidth
- The rational approximations of the unitary groups
- Exponential decay of correlations implies area law
- Improving gate-level simulation of quantum circuits
- A common algebraic description for probabilistic and quantum computations
- Erratum to: ``Signature theory in holographic algorithms
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- Quantum matchgate computations and linear threshold gates
- Simulating quantum computers with probabilistic methods
- Classical simulability, entanglement breaking, and quantum computation thresholds
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
- Holant problems for 3-regular graphs with complex edge functions
- On the satisfiability of quantum circuits of small treewidth
- scientific article; zbMATH DE number 5320194 (Why is no real title available?)
- A LOGIC FOR QUANTUM COMPUTATION AND CLASSICAL SIMULATION OF QUANTUM ALGORITHMS
- Matchgates and classical simulation of quantum circuits
- Classical simulation and complexity of quantum computations (invited talk)
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions
- scientific article; zbMATH DE number 1303028 (Why is no real title available?)
- Generalized counting constraint satisfaction problems with determinantal circuits
- A complete characterization of unitary quantum space
- On the Complexity of Holant Problems
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
- Classical Ising model test for quantum circuits
- Infrared-dressed entanglement of cold open-shell polar molecules for universal matchgate quantum computing
- Quantum computers that can be simulated classically in polynomial time
- Boson-sampling with non-interacting fermions
- Classification of a Class of Counting Problems Using Holographic Reductions
- A computational proof of complexity of some restricted counting problems
- Invited Talk: Embedding Classical into Quantum Computation
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- The complexity of symmetric Boolean parity Holant problems (extended abstract)
- \(P\) versus \(NP\) and geometry
- Commuting quantum circuits and complexity of Ising partition functions
- Holographic algorithms on domains of general size
- Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?
- Undirected determinant and its complexity
- Holographic algorithms: from art to science
- The computational complexity of Holant problems on 3-regular graphs
- Signature theory in holographic algorithms
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Brick wall quantum circuits with global fermionic symmetry
- A complexity trichotomy for k-regular asymmetric spin systems with complex edge functions
- Counting perfect matchings and the eight-vertex model
- From holant to quantum entanglement and back
- Counting degree-constrained orientations
- Fair selection of clearing schemes for kidney exchange markets
- Spin systems on k-regular graphs with complex edge functions
- Stabilizer testing and magic entropy via quantum Fourier analysis
- A minimal tensor network beyond free fermions
- Quantum circuits with free fermions in disguise
- On the theory of matchgate computations
- On blockwise symmetric signatures for matchgates
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits
- On symmetric signatures in holographic algorithms
This page was built for publication: Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149866)
