Quantum entanglement
All our former experience with application of quantum theory seems to say that what is
predicted by quantum formalism must occur in the laboratory. But the essence of quantum …
predicted by quantum formalism must occur in the laboratory. But the essence of quantum …
Catalysis in quantum information theory
Catalysts open up new reaction pathways that can speed up chemical reactions while not
consuming the catalyst. A similar phenomenon has been discovered in quantum information …
consuming the catalyst. A similar phenomenon has been discovered in quantum information …
Mip*= re
Note from the Research Highlights Co-Chairs: A Research Highlights paper appearing in
Communications is usually peer-reviewed prior to publication. The following paper is …
Communications is usually peer-reviewed prior to publication. The following paper is …
Nonlocality and communication complexity
Quantum information processing is the emerging field that defines and realizes computing
devices that make use of quantum mechanical principles such as the superposition …
devices that make use of quantum mechanical principles such as the superposition …
From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
The last decade has witnessed remarkable progress in the development of quantum
technologies. Although fault-tolerant devices likely remain years away, the noisy …
technologies. Although fault-tolerant devices likely remain years away, the noisy …
Verification of quantum computation: An overview of existing approaches
Quantum computers promise to efficiently solve not only problems believed to be intractable
for classical computers, but also problems for which verifying the solution is also considered …
for classical computers, but also problems for which verifying the solution is also considered …
Quantum computational complexity
J Watrous - arxiv preprint arxiv:0804.3401, 2008 - arxiv.org
This article surveys quantum computational complexity, with a focus on three fundamental
notions: polynomial-time quantum computations, the efficient verification of quantum proofs …
notions: polynomial-time quantum computations, the efficient verification of quantum proofs …
[BOOK][B] Bell nonlocality
V Scarani - 2019 - library.oapen.org
Nonlocality was discovered by John Bell in 1964, in the context of the debates about
quantum theory, but is a phenomenon that can be studied in its own right. Its observation …
quantum theory, but is a phenomenon that can be studied in its own right. Its observation …
Improvements in quantum SDP-solving with applications
Following the first paper on quantum algorithms for SDP-solving by Brand\~ ao and Svore in
2016, rapid developments has been made on quantum optimization algorithms. Recently …
2016, rapid developments has been made on quantum optimization algorithms. Recently …
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
Over 50 years ago, Lovász proved that two graphs are isomorphic if and only if they admit
the same number of homomorphisms from any graph. Other equivalence relations on …
the same number of homomorphisms from any graph. Other equivalence relations on …