Skip to search formSkip to main contentSkip to account menu

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.
View PDF on arXiv (opens in a new tab)

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…
View on Springer (opens in a new tab)

QUANTUM LOGIC GATES IN OPTICAL LATTICES

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…
View PDF on arXiv (opens in a new tab)

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…
View PDF on arXiv (opens in a new tab)

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.
View on PubMed (opens in a new tab)

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…
View PDF on arXiv (opens in a new tab)

Asymptotically optimal quantum circuits for d-level systems.

Both a lower bound and a constructive upper bound on the number of two-qudit gates result, proving a sharp asymptotic of theta(d(2n)) gates, which closes the complexity question for all d-level systems (d finite).
View on PubMed (opens in a new tab)

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.
View PDF on arXiv (opens in a new tab)

Room-temperature spontaneous superradiance from single diamond nanocrystals

The results pave the way towards a systematic study of SR in a well-controlled, solid-state quantum system at room temperature from single, highly luminescent diamond nanocrystals with spatial dimensions much smaller than the wavelength of light.
View on Springer (opens in a new tab)

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…
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)