| related words |
| tolerantly |
| timings |
| braiding |
| faulttolerant |
| hollenberg |
| nonbinary |
| codespace |
| decoders |
| piotrowski |
| sladkowski |
| ashikhmin |
| anticommutes |
| unencoded |
| subcode |
| duopoly |
| packing |
| parrondo |
| reichardt |
| flitney |
| encoders |
|
| related documents |
| Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall
State [0511178v1] |
| Accuracy threshold for postselected quantum computation [0703264v2] |
| Compatibility of subsystem states [0407227v3] |
| Fermionic quantum computation [0003137v2] |
| Classicality in discrete Wigner functions [0506222v1] |
| From Fermat's last theorem to the quantum computer [0307019v1] |
| Loss tolerance in one-way quantum computation via counterfactual error
correction [0507036v3] |
| Rethinking Renormalization for Quantum Phase Transitions [0405168v2] |
| Quantum Computation in Brain Microtubules? Decoherence and Biological
Feasibility [0005025v1] |
| Quantum computation via translation-invariant operations on a chain of
qubits [0505122v2] |
| Polynomial-Time Simulation of Pairing Models on a Quantum Computer [0108110v2] |
| N-representability is QMA-complete [0609125v1] |
| A simple family of nonadditive quantum codes [0701065v2] |
| On the quantum hardness of solving isomorphism problems as nonabelian
hidden shift problems [0510185v1] |
|
| related topics |
| {error, code, errors} |
| {states, state, optimal} |
| {state, algorithm, problem} |
| {qubit, qubits, gate} |
| {group, space, representation} |
| {theory, mechanics, state} |
| {let, theorem, proof} |
| {temperature, thermal, energy} |
| {state, states, entangled} |
| {operator, operators, space} |
| {algorithm, log, probability} |
| {time, decoherence, evolution} |
| {time, systems, information} |
| {observables, space, algebra} |
| {classical, space, random} |
| {force, casimir, field} |
| {state, phys, rev} |
| {measurement, state, measurements} |
| {entanglement, phys, rev} |
| {spin, pulse, spins} |
|