Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Oxford University Press eBooks

Milestones and a Fork in the Road

Michael G. Raymer

Published Sep 14, 2017• 0 citations
Publisher

Abstract

What aspects of quantum physics have we seen so far, and what topics should we discuss next? We find ourselves at a fork in the road on the way to understanding quantum physics. In a historical progression, it would make sense next to discuss...
DOI
10.1093/wentk/9780190250720.003.0007

Related papers

The role of complexity theory in quantum optics—a tutorial for BosonSampling

Jonathan P. Olson

Abstract BosonSampling is a recent development in linear optics which has stimulated a number of new computational models and algorithms in quantum computing. Much of this interest follows from the computational complexity arguments which show that the particular quantum system in which BosonSampling resides is difficult to simulate with a classical computer (assuming highly plausible conjectures) Arkhipov and Aaronson (2011 Proc. ACM STOC (New York) , p 333). These arguments, however, require some understanding of both quantum optics and complexity theory—topics that are rarely seen together. This tutorial is intended to introduce a reader to the topic who has at least a basic knowledge of quantum mechanics or quantum information theory, but may be unfamiliar with either quantum optics or complexity theory. Included is some historic context as well as an outlook on the potential for BosonSampling to be the first experimental demonstration of quantum supremacy. The emphasis of the first section is to develop a general context for the subfields of quantum optics and computer science that intersect to form the BosonSampling problem. This begins with a historical introduction and a background of quantum optics. We then progress to the physical system—quantum optical networks—where BosonSampling is defined. Finally, we provide a short introduction to computational complexity theory to provide a structure where the essence behind the BosonSampling result can be discerned. The second section focuses on the BosonSampling result itself, seeking to understand the computational complexity aspects of passive linear optical networks, and what consequences this may have. Some effort is spent discussing a number of issues inherent in the BosonSampling problem that are roadblocks to limiting the scope of its applicability, but that have made progress recently and remain active topics of research. The third short section touches on the relationship between BosonSampling and other quantum computing protocols. Namely, other settings and architectures that inherit the same complexity as BosonSampling will be presented, as well as giving a summary of experimental efforts to implement BosonSampling . We discuss similarities between BosonSampling and other quantum algorithms. In the final section, some comments are presented considering future research related to the problems and protocols found in this tutorial. We suggest other unexplored directions of study which may have some bearing on the complexity of quantum optics. Also included is a glossary of complexity terms used throughout the tutorial.

Journal of Optics•Oct 10, 2018•6 citations

A Few Questions on the Reasoning on Quantum Physics

Enric Trillas

Studies in fuzziness and soft computing•Jan 1, 2017•0 citations

The Many Roads Down which Quantum Mechanics is Headed

Christopher G. Timpson

Metascience•May 3, 2007•0 citations

QUANTUM COMPUTING – NEXT GENERATION COMPUTING TECHNOLOGY – A GENTLE INTRODUCTION

Prabhash Kumar, Dr. Shailaj Kumar Srivastava, Dr. Narendra Kumar +2 more

The limitations of traditional CMOS-Technology for bulk and highperformance computing applications may be solved by quantum computing. More scholars are turning to this topic as a result of its potential to change the modern computing industry. However, because quantum aspects are involved, many newcomers find it challenging to understand the field. Therefore, an effort has been made in this research note to introduce researchers, quantum engineers, and scientists to the many features of quantum computing research, quantum scientists and engineers. The historical context and fundamental ideas required to comprehend quantum-computation and processing of information have been clearly introduced. This paper also discusses various quantum computing physical implementations and prospective application domains

Iterative International Publishers eBooks•Dec 1, 2022•0 citations

There are many ways of theory (and none of them interpreting quantum quite makes sense)

Philip Ball

•Sep 21, 2020•0 citations

Poincaré's Electromagnetic Quantum Mechanics

Enrico Giannetto

Compiling a history of quantum mechanics is a very complex undertaking. Many roads have led to quantum theory: Heisenberg with Born and Jordan, Schrodinger, Dirac gave us the most important formulations of quantum mechanics. Another, neglected, historical rise of quantum physics is here considered by outlining the historical context in which different conceptions of Nature (mechanistic, thermodynamic and electromagnetic) were in competition to give a foundation to physics. In particular, the roots of quantum physics within the electromagnetic conception of Nature and Poincare’s quantum electromagnetic mechanics are discussed. This analysis can give a completely new understanding of quantum physics.

•Jan 1, 2008•0 citations
Abstract BosonSampling is a recent development in linear optics which has stimulated a number of new computational models and algorithms in quantum computing. Much of this interest follows from the computational complexity arguments which show that the particular quantum system in which BosonSampling resides is difficult to simulate with a classical computer (assuming highly plausible conjectures) Arkhipov and Aaronson (2011 Proc. ACM STOC (New York) , p 333). These arguments, however, require some understanding of both quantum optics and complexity theory—topics that are rarely seen together. This tutorial is intended to introduce a reader to the topic who has at least a basic knowledge of quantum mechanics or quantum information theory, but may be unfamiliar with either quantum optics or complexity theory. Included is some historic context as well as an outlook on the potential for BosonSampling to be the first experimental demonstration of quantum supremacy. The emphasis of the first section is to develop a general context for the subfields of quantum optics and computer science that intersect to form the BosonSampling problem. This begins with a historical introduction and a background of quantum optics. We then progress to the physical system—quantum optical networks—where BosonSampling is defined. Finally, we provide a short introduction to computational complexity theory to provide a structure where the essence behind the BosonSampling result can be discerned. The second section focuses on the BosonSampling result itself, seeking to understand the computational complexity aspects of passive linear optical networks, and what consequences this may have. Some effort is spent discussing a number of issues inherent in the BosonSampling problem that are roadblocks to limiting the scope of its applicability, but that have made progress recently and remain active topics of research. The third short section touches on the relationship between BosonSampling and other quantum computing protocols. Namely, other settings and architectures that inherit the same complexity as BosonSampling will be presented, as well as giving a summary of experimental efforts to implement BosonSampling . We discuss similarities between BosonSampling and other quantum algorithms. In the final section, some comments are presented considering future research related to the problems and protocols found in this tutorial. We suggest other unexplored directions of study which may have some bearing on the complexity of quantum optics. Also included is a glossary of complexity terms used throughout the tutorial.
The limitations of traditional CMOS-Technology for bulk and highperformance computing applications may be solved by quantum computing. More scholars are turning to this topic as a result of its potential to change the modern computing industry. However, because quantum aspects are involved, many newcomers find it challenging to understand the field. Therefore, an effort has been made in this research note to introduce researchers, quantum engineers, and scientists to the many features of quantum computing research, quantum scientists and engineers. The historical context and fundamental ideas required to comprehend quantum-computation and processing of information have been clearly introduced. This paper also discusses various quantum computing physical implementations and prospective application domains
Compiling a history of quantum mechanics is a very complex undertaking. Many roads have led to quantum theory: Heisenberg with Born and Jordan, Schrodinger, Dirac gave us the most important formulations of quantum mechanics. Another, neglected, historical rise of quantum physics is here considered by outlining the historical context in which different conceptions of Nature (mechanistic, thermodynamic and electromagnetic) were in competition to give a foundation to physics. In particular, the roots of quantum physics within the electromagnetic conception of Nature and Poincare’s quantum electromagnetic mechanics are discussed. This analysis can give a completely new understanding of quantum physics.