| related words |
| prefix |
| skipped |
| recognizable |
| delete |
| rogers |
| simulator |
| nondecreasing |
| acyclic |
| enumerable |
| referees |
| synchronize |
| theoret |
| physcomp |
| fortiori |
| parallelization |
| undecidable |
| transitional |
| enumeration |
| calude |
| bekenstein |
|
| related documents |
| Limits on Efficient Computation in the Physical World [0412143v2] |
| Distinguishability and Accessible Information in Quantum Theory [9601020v1] |
| Local Transition Functions of Quantum Turing Machines [9811069v2] |
| Quantum chaos in quantum Turing machines [9910068v2] |
| Spin-1/2 particles moving on a 2D lattice with nearest-neighbor
interactions can realize an autonomous quantum computer [0506270v2] |
| A Family of Grover's Quantum Searching Algorithms [0009086v1] |
| Local Search Methods for Quantum Computers [9802043v1] |
| Theory of the Quantum Speed Up [0010081v1] |
| Quantum Probabilistic Subroutines and Problems in Number Theory [9907020v2] |
| Deutsch-Jozsa algorithm for continuous variables [0207108v1] |
| Synchronizing quantum clocks with classical one-way communication:
Bounds on the generated entropy [0306023v1] |
| Theory of quantum computation [0010057v1] |
| Shor's Quantum Factoring Algorithm [0010034v1] |
| Programmable Quantum Networks with Pure States [0503230v1] |
| Analysis of Quantum Functions [9909012v4] |
|
| related topics |
| {time, systems, information} |
| {algorithm, log, probability} |
| {vol, operators, histories} |
| {state, algorithm, problem} |
| {qubit, qubits, gate} |
| {classical, space, random} |
| {operator, operators, space} |
| {let, theorem, proof} |
| {cos, sin, state} |
| {measurement, state, measurements} |
| {states, state, optimal} |
| {information, entropy, channel} |
| {state, phys, rev} |
| {theory, mechanics, state} |
| {cavity, atom, atoms} |
| {energy, gaussian, time} |
| {time, decoherence, evolution} |
| {alice, bob, state} |
| {state, states, entangled} |
| {observables, space, algebra} |
|