Matchgates and classical simulation of quantum circuits
From MaRDI portal
Publication:3560332
DOI10.1098/rspa.2008.0189zbMath1186.81046arXiv0804.4050OpenAlexW3101548872MaRDI QIDQ3560332
Publication date: 19 May 2010
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.4050
Related Items
Towards a multi target quantum computational logic ⋮ Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits ⋮ Unnamed Item ⋮ Matchgate shadows for fermionic quantum simulation ⋮ Commuting quantum circuits and complexity of Ising partition functions ⋮ Universal computation with quantum fields ⋮ Clifford algebras, quantum neural networks and generalized quantum Fourier transform ⋮ Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths? ⋮ Compressing the hidden variable space of a qubit ⋮ The rational approximations of the unitary groups ⋮ A Complete Characterization of Unitary Quantum Space ⋮ The power of noisy fermionic quantum computation ⋮ Infrared-dressed entanglement of cold open-shell polar molecules for universal matchgate quantum computing ⋮ Computing the Tutte polynomial of lattice path matroids using determinantal circuits ⋮ A matrix representation of quantum circuits over non-adjacent qudits ⋮ Temporally unstructured quantum computation ⋮ Free fermions behind the disguise ⋮ Effective simulation of state distribution in qubit chains ⋮ Disorder-assisted error correction in Majorana chains ⋮ Matchgate and space-bounded quantum computations are equivalent ⋮ Quantum matchgate computations and linear threshold gates ⋮ Unnamed Item ⋮ Quantum circuit approximations and entanglement renormalization for the Dirac field in \(1+1\) dimensions ⋮ Clifford Algebras, Spin Groups and Qubit Trees
Cites Work
- Fermionic quantum computation
- Fermionic linear optics revisited
- The statistics of dimers on a lattice
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Dimer problem in statistical mechanics-an exact result
- Remarks on duality transformations and generalized stabilizer states
- Generalization of Euler Angles to N-Dimensional Orthogonal Matrices
This page was built for publication: Matchgates and classical simulation of quantum circuits
