when you think about it that way, isn’t racing to build a cryptographically relevant QC, as quickly as possible, the most _ethical, socially responsible thing_ for an American QC company to do?

The way they see it, cryptographically relevant QCs _will_ plausibly be built sometime soon: indeed, it’s ultimately unavoidable, even if people’s only interest in QC was to do quantum simulations for materials science and chemistry.

some of the most reputable people in quantum hardware and quantum error-correction—people whose judgment I trust more than my own on those topics—are now telling me that a fault-tolerant quantum computer able to break deployed cryptosystems _ought_ to be possible by around 2029.

The best quantum processors make an error roughly once in every thousand operations. To become useful accelerators for scientific and enterprise problems, error rates must drop to one in a trillion or better.

quantum blockchain

A quantum blockchain, the pair suggests, would take advantage of entanglement, which in most cases, applies to situations regarding space. But it could also be useful for situations involving time, such as blockchains. In such a blockchain, the pair explains, transaction records could be represented by pairs of entangled photons linked in chronological order. When transfers take place, photons would be created and absorbed by the hubs that comprise a network. But since entangled photons are linked across time, they can be caused to have never existed at the same time.

​=(α∣0⟩+β∣1⟩)(γ∣0⟩+δ∣1⟩)=αγ∣00⟩+αδ∣01⟩+βγ∣10⟩+βδ∣11⟩.​

we apply a Hadamard gate

equal

the

What does it mean for a matrix UUU to be unitary? It’s easiest to answer this question algebraically, where it simply means that U†U=IU^\dagger U = IU†U=I, that is, the adjoint of UUU, denoted U†U^\daggerU†, times UUU, is equal to the identity matrix. That adjoint is, recall, the complex transpose of UUU:

this week’s announcement by Google that a machine made by a Canadian company, D-Wave Systems, which is marketed as “the world’s first commercial quantum computer”, had shown spectacular speed gains over conventional computers. “For a specific, carefully crafted proof-of-concept problem,” Google’s Hartmut Neven reported, “we achieved a 100-million-fold speed-up.”