The following pages link to QMA
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- BPP (complexity) (links | edit)
- BQP (links | edit)
- P versus NP problem (links | edit)
- Co-NP (links | edit)
- Computational complexity theory (links | edit)
- Electron (links | edit)
- NP (complexity) (links | edit)
- No-cloning theorem (links | edit)
- NC (complexity) (links | edit)
- Quantum computing (links | edit)
- Quantum information (links | edit)
- Quantum teleportation (links | edit)
- Qubit (links | edit)
- QAM (disambiguation) (links | edit)
- ♯P (links | edit)
- ♯P-complete (links | edit)
- PSPACE (links | edit)
- Shor's algorithm (links | edit)
- Quantum key distribution (links | edit)
- Co-NP-complete (links | edit)
- NP-hardness (links | edit)
- P-complete (links | edit)
- PSPACE-complete (links | edit)
- EXPTIME (links | edit)
- EXPSPACE (links | edit)
- RP (complexity) (links | edit)
- ZPP (complexity) (links | edit)
- Bell's theorem (links | edit)
- Grover's algorithm (links | edit)
- Schrödinger equation (links | edit)
- Interactive proof system (links | edit)
- Arithmetical hierarchy (links | edit)
- Timeline of quantum computing and communication (links | edit)
- UP (complexity) (links | edit)
- Deutsch–Jozsa algorithm (links | edit)
- Complexity class (links | edit)
- Probabilistically checkable proof (links | edit)
- Kane quantum computer (links | edit)
- Quantum algorithm (links | edit)
- NSPACE (links | edit)
- DSPACE (links | edit)
- DTIME (links | edit)
- NTIME (links | edit)
- P (complexity) (links | edit)
- PH (complexity) (links | edit)
- Polynomial hierarchy (links | edit)
- Quantum optics (links | edit)
- Quantum information science (links | edit)
- PP (complexity) (links | edit)
- Arthur–Merlin protocol (links | edit)