18,884 research outputs found
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
Non-locality and Communication Complexity
Quantum information processing is the emerging field that defines and
realizes computing devices that make use of quantum mechanical principles, like
the superposition principle, entanglement, and interference. In this review we
study the information counterpart of computing. The abstract form of the
distributed computing setting is called communication complexity. It studies
the amount of information, in terms of bits or in our case qubits, that two
spatially separated computing devices need to exchange in order to perform some
computational task. Surprisingly, quantum mechanics can be used to obtain
dramatic advantages for such tasks.
We review the area of quantum communication complexity, and show how it
connects the foundational physics questions regarding non-locality with those
of communication complexity studied in theoretical computer science. The first
examples exhibiting the advantage of the use of qubits in distributed
information-processing tasks were based on non-locality tests. However, by now
the field has produced strong and interesting quantum protocols and algorithms
of its own that demonstrate that entanglement, although it cannot be used to
replace communication, can be used to reduce the communication exponentially.
In turn, these new advances yield a new outlook on the foundations of physics,
and could even yield new proposals for experiments that test the foundations of
physics.Comment: Survey paper, 63 pages LaTeX. A reformatted version will appear in
Reviews of Modern Physic
Certified randomness in quantum physics
The concept of randomness plays an important role in many disciplines. On one
hand, the question of whether random processes exist is fundamental for our
understanding of nature. On the other hand, randomness is a resource for
cryptography, algorithms and simulations. Standard methods for generating
randomness rely on assumptions on the devices that are difficult to meet in
practice. However, quantum technologies allow for new methods for generating
certified randomness. These methods are known as device-independent because do
not rely on any modeling of the devices. Here we review the efforts and
challenges to design device-independent randomness generators.Comment: 18 pages, 3 figure
Multidimensional quantum entanglement with large-scale integrated optics
The ability to control multidimensional quantum systems is key for the
investigation of fundamental science and for the development of advanced
quantum technologies. Here we demonstrate a multidimensional integrated quantum
photonic platform able to robustly generate, control and analyze
high-dimensional entanglement. We realize a programmable bipartite entangled
system with dimension up to on a large-scale silicon-photonics
quantum circuit. The device integrates more than 550 photonic components on a
single chip, including 16 identical photon-pair sources. We verify the high
precision, generality and controllability of our multidimensional technology,
and further exploit these abilities to demonstrate key quantum applications
experimentally unexplored before, such as quantum randomness expansion and
self-testing on multidimensional states. Our work provides a prominent
experimental platform for the development of multidimensional quantum
technologies.Comment: Science, (2018
Improving randomness characterization through Bayesian model selection
Nowadays random number generation plays an essential role in technology with
important applications in areas ranging from cryptography, which lies at the
core of current communication protocols, to Monte Carlo methods, and other
probabilistic algorithms. In this context, a crucial scientific endeavour is to
develop effective methods that allow the characterization of random number
generators. However, commonly employed methods either lack formality (e.g. the
NIST test suite), or are inapplicable in principle (e.g. the characterization
derived from the Algorithmic Theory of Information (ATI)). In this letter we
present a novel method based on Bayesian model selection, which is both
rigorous and effective, for characterizing randomness in a bit sequence. We
derive analytic expressions for a model's likelihood which is then used to
compute its posterior probability distribution. Our method proves to be more
rigorous than NIST's suite and the Borel-Normality criterion and its
implementation is straightforward. We have applied our method to an
experimental device based on the process of spontaneous parametric
downconversion, implemented in our laboratory, to confirm that it behaves as a
genuine quantum random number generator (QRNG). As our approach relies on
Bayesian inference, which entails model generalizability, our scheme transcends
individual sequence analysis, leading to a characterization of the source of
the random sequences itself.Comment: 25 page
- …