• Corpus ID: 14689879

The Quantum Frontier

@article{Fitzsimons2014TheQF,
  title={The Quantum Frontier},
  author={Joseph Fitzsimons and Eleanor Gilbert Rieffel and Valerio Scarani},
  journal={ArXiv},
  year={2014},
  volume={abs/1206.0785}
}
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… 
Quantum interference as a resource for quantum speedup
Quantum states can in a sense be thought of as generalizations of classical probability distributions, but are more powerful than probability distributions when used for computation or communication.
Entanglement and interference resources in quantum computation and communication
TLDR
This dissertation contains results on three quite different topics that investigate the entanglement resources required for two parties to jointly implement a unitary operation using local operations and classical communication, and generalizes the concept of graph homomorphism to non-commutative graphs to the quantum case.
Value Indefiniteness, Randomness and Unpredictability in Quantum Foundations. (De la Valeur Indéfinie aux Notions d'Aléatoire et d'Imprévisibilité Quantiques)
TLDR
A formal model of prediction that can be used to asses the predictability of arbitrary physical experiments is proposed, and it is shown that the outcome of a single measurement of a value indefinite quantum observable is formally unpredictable.
A Non-Probabilistic Model of Relativised Predictability in Physics
TLDR
A more refined model that is capable of studying different degrees of “relativised” unpredictability is presented, showing that quantum complementarity guarantees a form of relativised unpredictability that is weaker than that guaranteed by Kochen–Specker-type value indefiniteness.
Entanglement verification and steering when Alice and Bob cannot be trusted
Various protocols exist by which a referee can be convinced that two observers share an entangled resource. Such protocols typically specify the types of communication allowed, and the degrees of
Er-Doped Nanostructured BaTiO3 for NIR to Visible Upconversion
TLDR
This research shows the existence of a strong correlation between Ba/Ti ratios, erbium concentration, phase structure and doping site location on the upconversion photoluminescent mechanisms inErbium-doped barium titanate nanoparticle systems.
Quantitative wave–particle duality relations from the density matrix properties
We derive upper bounds for Hilbert–Schmidt’s quantum coherence of general states of a d -level quantum system, a qudit, in terms of its incoherent uncertainty, with the latter quantified using the

References

SHOWING 1-10 OF 115 REFERENCES
Quantum and classical tradeoffs
  • Yaoyun Shi
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2004
TLDR
This paper presents two results on the study of quantifying the quantumness of a quantum circuit by the number of gates that do not preserve the computational basis, as a means to understand the nature of quantum algorithmic speedups.
Quantum Complexity Theory
TLDR
This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.
Quantum computers that can be simulated classically in polynomial time
TLDR
It is shown that two-bit operations characterized by 4 \times 4 matrices in which the sixteen entries obey a set of five polynomial relations can be composed according to certain rules to yield a class of circuits that can be simulated classically in polynometric time.
The quantum FFT can be classically simulated
In this note we describe a simple and intriguing observation: the quantum Fourier transform (QFT) over Zq, which is considered the most “quantum” part of Shor’s algorithm, can in fact be simulated
Quantum Measurement and Control
In the last two decades there has been an enormous progress in the experimental investigation of single quantum systems. This progress covers fields such as quantum optics, quantum computation,
Using Quantum Computers for Quantum Simulation
TLDR
The theoretical and experimental development of quantum simulation using quantum computers is surveyed, from the first ideas to the intense research efforts currently underway.
Most quantum States are too entangled to be useful as computational resources.
TLDR
It is shown that quantum states can be too entangled to be useful for the purpose of computation, in that high values of the geometric measure of entanglement preclude states from offering a universal quantum computational speedup.
Quantum Algorithms
TLDR
New small size quantum computers are coming to age and the use of such a machine brings the possibility of exploring new quantum algorithms, which makes feasible attacking optimization problems, which are relevant for different industries.
On the role of entanglement in quantum-computational speed-up
  • R. Jozsa, N. Linden
  • Mathematics, Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 2003
For any quantum algorithm operating on pure states, we prove that the presence of multi‐partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the
Quantum computing, postselection, and probabilistic polynomial-time
  • S. Aaronson
  • Computer Science, Mathematics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2005
TLDR
It is shown that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently, or probabilistic polynomial-time, and implies, as an easy corollary, a celebrated theorem of Beigel, Reingold and Spielman that PP is closed under intersection.
...
1
2
3
4
5
...