• Publications
  • Influence
A toolbox for lattice-spin models with polar molecules
There is growing interest in states of matter with topological order. These are characterized by highly stable ground states robust to perturbations that preserve the topology, and which support
Quantum Attacks on Bitcoin, and How to Protect Against Them
It is found that the proof-of-work used by Bitcoin is relatively resistant to substantial speedup by quantum computers in the next 10 years, mainly because specialized ASIC miners are extremely fast compared to the estimated clock speed of near-term quantum computers.
We propose a new system for implementing quantum logic gates: neutral atoms trapped in a very far-off-resonance optical lattice. Pairs of atoms are made to occupy the same well by varying the
Entanglement dynamics in one-dimensional quantum cellular automata
Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex
Quantum magnetomechanics: ultrahigh-Q-levitated mechanical oscillators.
This work examines a magneto-meso-mechanical quantum system that consists of a 3D arrangement of miniature superconducting loops which is stably levitated in a static inhomogeneous magnetic field and inductively coupling this levitating object to a nearby driven flux qubit may permit the generation of macroscopic entangled motional states of multiple clusters.
Canonical decompositions of n-qubit quantum computations and concurrence
The two-qubit canonical decomposition SU(4)=[SU(2)⊗SU(2)]Δ[SU(2)⊗SU(2)] writes any two-qubit unitary operator as a composition of a local unitary, a relative phasing of Bell states, and a second
Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian.
Every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body interactions, so that it equips built-in robustness against noise in a ground-code measurement-based quantum computer.
Parallelism for quantum computation with qudits
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high-fidelity two-qudit gates. We first describe how to implement parallel
Efficient circuits for exact-universal computationwith qudits
It is shown that controlled two-qudit gates can be implemented without ancillas and it is proved that the gate library containing arbitrary local unitaries and one two- qudit gate, CINC, is exact-universal.
Quantum walks with memory provided by recycled coins and a memory of the coin-flip history
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model