| related words |
| factoring |
| vazirani |
| wolfram |
| cleve |
| watrous |
| automaton |
| parallelism |
| intractable |
| polylog |
| oracles |
| subroutine |
| architectures |
| prover |
| processors |
| verifier |
| indifference |
| designing |
| merlin |
| repetitions |
| pspace |
|
| related documents |
| Quantum finite multitape automata [9905026v1] |
| Quantum Finite State Transducers [0011052v2] |
| Quantum cellular automata quantum computing with endohedral fullerenes [0210202v1] |
| Programmable Quantum Networks with Pure States [0503230v1] |
| Book Review: 'A New Kind of Science' [0206089v2] |
| On Computational Power of Quantum Branching Programs [0302022v1] |
| Simulating quantum mechanics on a quantum computer [9701019v2] |
| A universally programmable Quantum Cellular Automaton [0512058v3] |
| Limits on Efficient Computation in the Physical World [0412143v2] |
| Lower Bounds on Quantum Query Complexity [0509153v1] |
| Spin-1/2 particles moving on a 2D lattice with nearest-neighbor
interactions can realize an autonomous quantum computer [0506270v2] |
| QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols [0510230v3] |
| About the quantum mechanical speeding up of classical algorithms [9706003v4] |
| ROM-based computation: quantum versus classical [0109016v2] |
| Interaction in Quantum Communication [0603135v1] |
| Improved Lower Bounds for Locally Decodable Codes and Private
Information Retrieval [0403140v2] |
| Towards a Theory of Conservative Computing [0211085v2] |
| Fault-tolerant quantum computation [9712048v1] |
| A New Type of Limit Theorems for the One-Dimensional Quantum Random Walk [0206103v5] |
| The lambda-q calculus can efficiently simulate quantum computers [9702057v1] |
|
| related topics |
| {algorithm, log, probability} |
| {qubit, qubits, gate} |
| {spin, pulse, spins} |
| {state, algorithm, problem} |
| {theory, mechanics, state} |
| {let, theorem, proof} |
| {time, systems, information} |
| {error, code, errors} |
| {temperature, thermal, energy} |
| {classical, space, random} |
| {time, decoherence, evolution} |
| {key, protocol, security} |
| {states, state, optimal} |
| {field, particle, equation} |
| {operator, operators, space} |
| {cos, sin, state} |
| {observables, space, algebra} |
| {state, phys, rev} |
| {bell, inequality, local} |
| {alice, bob, state} |
|