Quantum matchgate computations and linear threshold gates
From MaRDI portal
Publication:3076715
DOI10.1098/rspa.2010.0332zbMath1207.81016arXiv1005.1143OpenAlexW3106511654MaRDI QIDQ3076715
Publication date: 23 February 2011
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/1005.1143
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Halfspace matrices
- Majority gates vs. general weighted threshold gates
- Threshold circuits of bounded depth
- Theory of majority decision elements
- The statistics of dimers on a lattice
- Quantum computational networks
- Universal Quantum Simulators
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- The Perceptron: A Model for Brain Functioning. I
- Agnostically Learning Halfspaces
- Matchgates and classical simulation of quantum circuits
- On the Size of Weights for Threshold Gates
- Quantum Complexity Theory
- Simulating Threshold Circuits by Majority Circuits
- On the role of entanglement in quantum-computational speed-up
- Matchgate and space-bounded quantum computations are equivalent
- Dimer problem in statistical mechanics-an exact result
This page was built for publication: Quantum matchgate computations and linear threshold gates
