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 polarization of the trapping lasers, and then a near-resonant electric dipole is induced by an auxiliary laser. A controlled-NOT can be implemented by conditioning the target atomic resonance on a resolvable level shift induced by the control atom. Atoms interact only during logical operations, thereby suppressing decoherence.
We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, 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. Second, computation is processed by single-spin measurements along multiple chains dynamically coupled on demand, so as to keep teleporting only logical information into a gap-protected ground state of the residual chains after the interactions with spins to be measured are turned off. We describe implementations using trapped atoms or polar molecules in an optical lattice, where the gap is expected to be as large as 0.2 or 4.8 kHz, respectively.
Scalability of a quantum computation requires that the information be processed on multiple subsystems. However, it is unclear how the complexity of a quantum algorithm, quantified by the number of entangling gates, depends on the subsystem size. We examine the quantum circuit complexity for exactly universal computation on many -level systems (qudits). Both a lower bound and a constructive upper bound on the number of two-qudit gates result, proving a sharp asymptotic of gates. This closes the complexity question for all -level systems ( finite). The optimal asymptotic applies to systems with locality constraints, e.g., nearest neighbor interactions.
The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer. One particular area at risk is cryptocurrencies, a market currently worth over 100 billion USD. We investigate the risk posed to Bitcoin, and other cryptocurrencies, by attacks using quantum computers. We find 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. On the other hand, the elliptic curve signature scheme used by Bitcoin is much more at risk, and could be completely broken by a quantum computer as early as 2027, by the most optimistic estimates. We analyze an alternative proof-of-work called Momentum, based on finding collisions in a hash function, that is even more resistant to speedup by a quantum computer. We also review the available post-quantum signature schemes to see which one would best meet the security and efficiency requirements of blockchain applications.
Anyons are particlelike excitations of strongly correlated phases of matter with fractional statistics, characterized by nontrivial changes in the wave function, generalizing Bose and Fermi statistics, when two of them are interchanged. This can be used to perform quantum computations [A. Yu. Kitaev, Ann. Phys. (N.Y.) 303, 2 (2003)]. We show how to simulate the creation and manipulation of Abelian and non-Abelian anyons in topological lattice models using trapped atoms in optical lattices. Our proposal, feasible with present technology, requires an ancilla particle which can undergo single-particle gates, be moved close to each constituent of the lattice and undergo a simple quantum gate, and be detected.