| related words |
| satisfiable |
| andris |
| provers |
| unmarked |
| databases |
| spalek |
| workspace |
| papadimitriou |
| robots |
| adders |
| voronoi |
| subexponential |
| pseudorandom |
| polylogarithmic |
| quantumly |
| greedy |
| walshhadamard |
| subgraphs |
| algorithmically |
| tradeoffs |
|
| related documents |
| Limits on Efficient Computation in the Physical World [0412143v2] |
| Eigenvector Approximation Leading to Exponential Speedup of Quantum
Eigenvalue Calculation [0308016v1] |
| The Quantum Query Complexity of Elliptic PDE [0512241v1] |
| On the impossibility of a quantum sieve algorithm for graph isomorphism:
unconditional results [0612089v3] |
| Anyons from non-solvable finite groups are sufficient for universal
quantum computation [0206128v2] |
| A new adiabatic quantum search algorithm [0308060v1] |
| Theory of the Quantum Speed Up [0010081v1] |
| Coordinating quantum agents' perspectives: convex operational theories,
quantum information, and quantum foundations [0611110v1] |
|
| related topics |
| {algorithm, log, probability} |
| {state, algorithm, problem} |
| {error, code, errors} |
| {observables, space, algebra} |
| {let, theorem, proof} |
| {qubit, qubits, gate} |
| {group, space, representation} |
| {theory, mechanics, state} |
| {time, systems, information} |
| {states, state, optimal} |
| {measurement, state, measurements} |
| {field, particle, equation} |
| {force, casimir, field} |
| {spin, pulse, spins} |
| {equation, function, exp} |
| {operator, operators, space} |
| {particle, mechanics, theory} |
| {information, entropy, channel} |
| {alice, bob, state} |
| {key, protocol, security} |
|