68 research outputs found
Post hoc verification of quantum computation
With recent progress on experimental quantum information processing, an
important question has arisen as to whether it is possible to verify arbitrary
computation performed on a quantum processor. A number of protocols have been
proposed to achieve this goal, however all are interactive in nature, requiring
that the computation be performed in an interactive manner with back and forth
communication between the verifier and one or more provers. Here we propose two
methods for verifying quantum computation in a non-interactive manner based on
recent progress in the understanding of the local Hamiltonian problem. Provided
that the provers compute certain witnesses for the computation, this allows the
result of a quantum computation to be verified after the fact, a property not
seen in current verification protocols.Comment: 4 pages, 2 figure
Quantum walks with encrypted data
In the setting of networked computation, data security can be a significant
concern. Here we consider the problem of allowing a server to remotely
manipulate client supplied data, in such a way that both the information
obtained by the client about the server's operation and the information
obtained by the server about the client's data are significantly limited. We
present a protocol for achieving such functionality in two closely related
models of restricted quantum computation -- the Boson sampling and quantum walk
models. Due to the limited technological requirements of the Boson scattering
model, small scale implementations of this technique are feasible with
present-day technology.Comment: 4 pages, 2 figure
The Quantum Frontier
The success of the abstract model of computation, in terms of bits, logical
operations, programming language constructs, and the like, makes it easy to
forget that computation is a physical process. Our cherished notions of
computation and information are grounded in classical mechanics, but the
physics underlying our world is quantum. In the early 80s researchers began to
ask how computation would change if we adopted a quantum mechanical, instead of
a classical mechanical, view of computation. Slowly, a new picture of
computation arose, one that gave rise to a variety of faster algorithms, novel
cryptographic mechanisms, and alternative methods of communication. Small
quantum information processing devices have been built, and efforts are
underway to build larger ones. Even apart from the existence of these devices,
the quantum view on information processing has provided significant insight
into the nature of computation and information, and a deeper understanding of
the physics of our universe and its connections with computation.
We start by describing aspects of quantum mechanics that are at the heart of
a quantum view of information processing. We give our own idiosyncratic view of
a number of these topics in the hopes of correcting common misconceptions and
highlighting aspects that are often overlooked. A number of the phenomena
described were initially viewed as oddities of quantum mechanics. It was
quantum information processing, first quantum cryptography and then, more
dramatically, quantum computing, that turned the tables and showed that these
oddities could be put to practical effect. It is these application we describe
next. We conclude with a section describing some of the many questions left for
future work, especially the mysteries surrounding where the power of quantum
information ultimately comes from.Comment: Invited book chapter for Computation for Humanity - Information
Technology to Advance Society to be published by CRC Press. Concepts
clarified and style made more uniform in version 2. Many thanks to the
referees for their suggestions for improvement
Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
Exquisite quantum control has now been achieved in small ion traps, in
nitrogen-vacancy centres and in superconducting qubit clusters. We can regard
such a system as a universal cell with diverse technological uses from
communication to large-scale computing, provided that the cell is able to
network with others and overcome any noise in the interlinks. Here we show that
loss-tolerant entanglement purification makes quantum computing feasible with
the noisy and lossy links that are realistic today: With a modestly complex
cell design, and using a surface code protocol with a network noise threshold
of 13.3%, we find that interlinks which attempt entanglement at a rate of 2MHz
but suffer 98% photon loss can result in kilohertz computer clock speeds (i.e.
rate of high fidelity stabilizer measurements). Improved links would
dramatically increase the clock speed. Our simulations employed local gates of
a fidelity already achieved in ion trap devices.Comment: corrected typos, additional references, additional figur
- …