| related words |
| clauses |
| conflicts |
| hilberts |
| diophantine |
| gutmann |
| searches |
| unstructured |
| fusion |
| goldstone |
| median |
| satisfiability |
| representability |
| simulatable |
| tiling |
| hypercomputation |
| sipser |
| runtime |
| percolation |
| nishimori |
| heuristics |
|
| related documents |
| Quantum Computation by Adiabatic Evolution [0001106v1] |
| Quantum Algorithm to Solve Satisfiability Problems [0411194v2] |
| Local Search Methods for Quantum Computers [9802043v1] |
| Tailoring Many-Body Interactions to Solve Hard Combinatorial Problems [9702039v4] |
| Quantum NP - A Survey [0210077v1] |
| Simulation of Quantum Adiabatic Search in the Presence of Noise [0601116v1] |
| Quantum Portfolios [0105071v2] |
| Spectral implementation of some quantum algorithms by one- and
two-dimensional nuclear magnetic resonance [0503101v1] |
| Systematic Analysis of Majorization in Quantum Algorithms [0212094v2] |
| Robustness of adiabatic quantum computation [0108048v1] |
| Adiabatic Quantum Computing for Random Satisfiability Problems [0206059v2] |
| Minimal Informationally Complete Measurements for Pure States [0404137v1] |
| Finding Solutions to NP Problems: Philosophical Difference Between
Quantum and Evolutionary Search Algorithms [0010021v1] |
| Limits on Efficient Computation in the Physical World [0412143v2] |
| Quantum non-locality in two three-level systems [0111143v2] |
|
| related topics |
| {state, algorithm, problem} |
| {states, state, optimal} |
| {bell, inequality, local} |
| {state, states, entangled} |
| {algorithm, log, probability} |
| {spin, pulse, spins} |
| {entanglement, phys, rev} |
| {theory, mechanics, state} |
| {qubit, qubits, gate} |
| {cos, sin, state} |
| {vol, operators, histories} |
| {let, theorem, proof} |
| {measurement, state, measurements} |
| {information, entropy, channel} |
| {group, space, representation} |
| {time, systems, information} |
| {phase, path, phys} |
| {light, field, probe} |
| {force, casimir, field} |
| {state, phys, rev} |
|