Search PubMed⌕ Search

Biomedical subjects

Daniel A Lidar

Publications and source records attributed to Daniel A Lidar.

7 recordsLinked to original sources

Fault-tolerant quantum computation via exchange interactions.

Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and control of effective exchange interactions and possibly a global magnetic field. This "encoded universality" paradigm offers potential simplifications in quantum computer design since it does away with the need to control physical qubits individually. Here we show how encoded universality schemes can be combined with fault-tolerant quantum error correction, thus establishing the scalability of such schemes.

Journal Article↗

One-spin quantum logic gates from exchange interactions and a global magnetic field.

It has been widely assumed that one-qubit gates in spin-based quantum computers suffer from severe technical difficulties. We show that one-qubit gates can, in fact, be generated using only modest and presently feasible technological requirements. Our solution uses only global magnetic fields and controllable Heisenberg exchange interactions, thus circumventing the need for single-spin addressing.

Journal Article↗

Three- and four-body interactions in spin-based quantum computers.

In the effort to design and to construct a quantum computer, several leading proposals make use of spin-based qubits. These designs generally assume that spins undergo pairwise interactions. We point out that, when several spins are engaged mutually in pairwise interactions, the quantitative strengths of the interactions can change and qualitatively new terms can arise in the Hamiltonian, including four-body interactions. In parameter regimes of experimental interest, these coherent effects are large enough to interfere with computation and may require new error correction or avoidance techniques.

Journal Article↗

Quantum tensor product structures are observable induced.

It is argued that the partition of a quantum system into subsystems is dictated by the set of operationally accessible interactions and measurements. The emergence of a multipartite tensor product structure of the state space and the associated notion of quantum entanglement are then relative and observable induced. We develop a general algebraic framework aimed to formalize this concept.

Journal Article↗

Magnetic resonance realization of decoherence-free quantum computation.

We report the realization, using nuclear magnetic resonance techniques, of the first quantum computer that reliably executes a complete algorithm in the presence of strong decoherence. The computer is based on a quantum error avoidance code that protects against a class of multiple-qubit errors. The code stores two decoherence-free logical qubits in four noisy physical qubits. The computer successfully executes Grover's search algorithm in the presence of arbitrarily strong engineered decoherence. A control computer with no decoherence protection consistently fails under the same conditions.

Journal Article↗

Comprehensive encoding and decoupling solution to problems of decoherence and design in solid-state quantum computing.

Proposals for scalable quantum computing devices suffer not only from decoherence due to the interaction with their environment, but also from severe engineering constraints. Here we introduce a practical solution to these major concerns, addressing solid-state proposals in particular. Decoherence is first reduced by encoding a logical qubit into two qubits, then completely eliminated by an efficient set of decoupling pulse sequences. The same encoding removes the need for single-qubit operations, which pose a difficult design constraint. We further show how the dominant decoherence processes can be identified empirically, in order to optimize the decoupling pulses.

Journal Article↗