| related words |
| breyta |
| transistors |
| architectures |
| copyright |
| benchmark |
| exploitation |
| outperform |
| undone |
| initializing |
| controllednot |
| steffen |
| designs |
| interconnected |
| slowdown |
| cancelling |
| schoelkopf |
| larsen |
| technologically |
| singlequbit |
| negrevergne |
|
| related documents |
| Representation of Boolean Quantum Circuits as Reed-Muller Expansions [0305134v1] |
| Generation of two-mode nonclassical states and a quantum phase gate
operation in trapped ion cavity QED [0204070v1] |
| On the Problem of Programming Quantum Computers [0008015v2] |
| Optimized quantum implementation of elliptic curve arithmetic over
binary fields [0407095v1] |
| Shor's Quantum Factoring Algorithm [0010034v1] |
| Sideband cooling while preserving coherences in the nuclear spin state
in group-II-like atoms [0702120v4] |
| Quantum computation via translation-invariant operations on a chain of
qubits [0505122v2] |
| Quantum phase estimation algorithms with delays: effects of dynamical
phases [0305038v2] |
| Cooling the Collective Motion of Trapped Ions to Initialize a Quantum
Register [9803023v4] |
| Quantum cellular automata quantum computing with endohedral fullerenes [0210202v1] |
| Perfect Cluster States from Imperfect Global Entanglement [0605244v3] |
| Theory of Initialization-Free Decoherence-Free Subspaces and Subsystems [0505051v1] |
| Local Search Methods for Quantum Computers [9802043v1] |
| An Electron-Nucleon Double Spin Solid-State Quantum Computer [0307054v1] |
| Finding Solutions to NP Problems: Philosophical Difference Between
Quantum and Evolutionary Search Algorithms [0010021v1] |
| A Continuous Variable Shor Algorithm [0210141v2] |
| "Spectral Implementation" for creating a labeled pseudo-pure state and
the Bernstein-Vazirani's algorithm in a four-qubit nuclear magnetic resonance
quantum processor [0202008v2] |
| Transport of Quantum States and Separation of Ions in a Dual RF Ion Trap [0205094v1] |
| Fermionic quantum computation [0003137v2] |
| Anyons from non-solvable finite groups are sufficient for universal
quantum computation [0206128v2] |
|
| related topics |
| {qubit, qubits, gate} |
| {spin, pulse, spins} |
| {trap, ion, state} |
| {algorithm, log, probability} |
| {state, algorithm, problem} |
| {state, states, coherent} |
| {state, phys, rev} |
| {time, decoherence, evolution} |
| {time, systems, information} |
| {level, atom, field} |
| {energy, gaussian, time} |
| {photon, photons, single} |
| {let, theorem, proof} |
| {information, entropy, channel} |
| {error, code, errors} |
| {light, field, probe} |
| {states, state, optimal} |
| {operator, operators, space} |
| {equation, function, exp} |
| {observables, space, algebra} |
|