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

IEEE International Parallel and Distributed Processing Symposium (IPDPS)

Keynote Speech: Quantum Physics and the Nature of Computation

Umesh V. Vazirani

Published Mar 1, 2007• 2 citations
Publisher

Abstract

Quantum physics is a fascinating area from a computational viewpoint. The features that make quantum systems prohibitively hard to simulate classically are precisely the aspects exploited by quantum computation to obtain exponential speedups over classical computers. In this talk I will survey our current understanding of the power (and limits) of quantum computers, and prospects for experimentally realizing them in the near future. I will also touch upon insights from quantum comuptation that have resulted in new classical algorithms for efficient simulation of certain important quantum systems.

DOI
10.1109/ipdps.2007.370207

Related papers

Quantum Computation: Entangling with the Future

Jiang Zhang

Commercial applications of quantum computation have become viable due to the rapid progress of the field in the recent years. Efficient quantum algorithms are discovered to cope with the most challenging real-world problems that are too hard for classical computers. Manufactured quantum hardware has reached unprecedented precision and controllability, enabling fault-tolerant quantum computation. Here, I give a brief introduction on what principles in quantum mechanics promise its unparalleled computational power. I will discuss several important quantum algorithms that achieve exponential or polynomial speedup over any classical algorithm. Building a quantum computer is a daunting task, and I will talk about the criteria and various implementations of quantum computers. I conclude the talk with near-future commercial applications of a quantum computer.

•Apr 1, 2017•0 citations

Quantum computing: a survey

Siddhartha Kasivajhula

Computers today become faster by becoming smaller. By reducing the size of transistors, engineers are able to fit more of them on a given size microprocessor, thus increasing the processor's computational power. This process cannot continue forever. It has been estimated that sometime within the next two decades, at the current rate, engineers will be faced with the problem of building something that is smaller than an atom. This is as far as our current "classical" computing paradigm will take us. Quantum computing is a potential solution to this problem. This paradigm of computing seeks to directly exploit quantum mechanical phenomena to perform calculations or in some way boost computational efficiency. Some problems can theoretically be solved on a quantum computer exponentially faster than on a classical computer. An overview of the subject is provided here with emphasis on quantum information processing and physical realizations of a quantum computer. Included is a brief history of the subject, a discussion of quantum computing notions such as parallelism and entanglement and their use in quantum algorithms, and conjecture on the prospects and pitfalls of this theory.

ACM Southeast Regional Conference (ACMSE)•Mar 10, 2006•9 citations

Quantum simulation of quantum field theory using continuous variables

Kevin Marshall, Raphael C. Pooser, George Siopsis +1 more

The year 1982 is often credited as the year that theoretical quantum computing was started with a keynote speech by Richard Feynman, who proposed a universal quantum simulator, the idea being that if you had such a machine you could in principle ``imitate any quantum system, including the physical world.'' With that in mind, we present an algorithm for a continuous-variable quantum computing architecture which gives an exponential speedup over the best-known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonic quantum field theory, a problem that is believed to be hard using a classical computer. Building on this, we give an experimental implementation based on continuous-variable states that is feasible with today's technology.

arXiv:1503.08121•Physical Review A•Dec 14, 2015•84 citations

Keynote addresses: Quantum computing: Revolutionizing computation through quantum mechanics

Krysta M. Svore

In 1981, Richard Feynman proposed a device called a "quantum computer" to take advantage of the laws of quantum physics to achieve computational speed-ups over classical methods. Quantum computing promises to revolutionize how and what we compute. Over the course of three decades, quantum algorithms have been developed that offer fast solutions to problems in a variety of fields including number theory, optimization, chemistry, physics, and materials science. Quantum devices have also significantly advanced such that components of a scalable quantum computer have been demonstrated; the promise of implementing quantum algorithms is in our near future. I will attempt to explain some of the mysteries of this disruptive, revolutionary computational paradigm and how it will transform our digital age.

International Conference on Computer Aided Design•Nov 1, 2017•0 citations

Impact of Quantum Information Technology on Future National Security Space

Benjamin Bowes, Tzvetan S. Metodi, Samuel D. Gasster +2 more

The current state of the art in space systems would not be possible without the advances in our understanding of matter and light at the atomic level provided by quantum theory. This triumph of 20th century physics provides the foundation for most of the components employed in satellites from integrated circuits, solar cells, atomic clocks, and advanced materials. Over the past 25 years a new understanding of the relationship between quantum theory, theory and security, and computing has raised the possibility of exploiting \quantum information for computing and secure encryption key generation. The eld of quantum science exploits quantum states for processing and security applications. The power of quantum derives from the quantum nature of matter that allow algorithms with exponential speed-up when compared to the best-known classical algorithms. Quantum Key Distribution involves using quantum states, typically encoded into the phase or polarization of photons, to securely share the bits to be used to construct an encryption key. The theoretical security of quantum key distribution rests on the physical laws of quantum theory, unlike classical cryptography that relies on assumptions about the computational complexity of certain mathematical problems. In this paper we survey the state of quantum science and technology, summarizing the basic features of quantum processing and key distribution. We describe the potential for quantum computing and key distribution to support future NSS applications and missions, for both the ground and space segments. We conclude with a discussion of the current challenges with advancing quantum technology to meet these future needs.

AIAA SPACE Conference & Exposition•Jun 14, 2011•0 citations

Contemplating quantum computation

D. Mermin

People with surprisingly diverse points of view see quantum computation as vindicating their pet idea of what quantum mechanics is all about. The present speaker is no exception. In this introductory talk I shall describe a few elementary quantum algorithms with a view to revealing their intrinsic charm, and illustrating this blind-men-and-the-elephant aspect of that charm.

Optical Fiber Communication Conference•Jan 1, 2001•0 citations
Quantum physics is a fascinating area from a computational viewpoint. The features that make quantum systems prohibitively hard to simulate classically are precisely the aspects exploited by quantum computation to obtain exponential speedups over classical computers. In this talk I will survey our current understanding of the power (and limits) of quantum computers, and prospects for experimentally realizing them in the near future. I will also touch upon insights from quantum comuptation that have resulted in new classical algorithms for efficient simulation of certain important quantum systems.
Commercial applications of quantum computation have become viable due to the rapid progress of the field in the recent years. Efficient quantum algorithms are discovered to cope with the most challenging real-world problems that are too hard for classical computers. Manufactured quantum hardware has reached unprecedented precision and controllability, enabling fault-tolerant quantum computation. Here, I give a brief introduction on what principles in quantum mechanics promise its unparalleled computational power. I will discuss several important quantum algorithms that achieve exponential or polynomial speedup over any classical algorithm. Building a quantum computer is a daunting task, and I will talk about the criteria and various implementations of quantum computers. I conclude the talk with near-future commercial applications of a quantum computer.
Computers today become faster by becoming smaller. By reducing the size of transistors, engineers are able to fit more of them on a given size microprocessor, thus increasing the processor's computational power. This process cannot continue forever. It has been estimated that sometime within the next two decades, at the current rate, engineers will be faced with the problem of building something that is smaller than an atom. This is as far as our current "classical" computing paradigm will take us. Quantum computing is a potential solution to this problem. This paradigm of computing seeks to directly exploit quantum mechanical phenomena to perform calculations or in some way boost computational efficiency. Some problems can theoretically be solved on a quantum computer exponentially faster than on a classical computer. An overview of the subject is provided here with emphasis on quantum information processing and physical realizations of a quantum computer. Included is a brief history of the subject, a discussion of quantum computing notions such as parallelism and entanglement and their use in quantum algorithms, and conjecture on the prospects and pitfalls of this theory.
The year 1982 is often credited as the year that theoretical quantum computing was started with a keynote speech by Richard Feynman, who proposed a universal quantum simulator, the idea being that if you had such a machine you could in principle ``imitate any quantum system, including the physical world.'' With that in mind, we present an algorithm for a continuous-variable quantum computing architecture which gives an exponential speedup over the best-known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonic quantum field theory, a problem that is believed to be hard using a classical computer. Building on this, we give an experimental implementation based on continuous-variable states that is feasible with today's technology.
In 1981, Richard Feynman proposed a device called a "quantum computer" to take advantage of the laws of quantum physics to achieve computational speed-ups over classical methods. Quantum computing promises to revolutionize how and what we compute. Over the course of three decades, quantum algorithms have been developed that offer fast solutions to problems in a variety of fields including number theory, optimization, chemistry, physics, and materials science. Quantum devices have also significantly advanced such that components of a scalable quantum computer have been demonstrated; the promise of implementing quantum algorithms is in our near future. I will attempt to explain some of the mysteries of this disruptive, revolutionary computational paradigm and how it will transform our digital age.
The current state of the art in space systems would not be possible without the advances in our understanding of matter and light at the atomic level provided by quantum theory. This triumph of 20th century physics provides the foundation for most of the components employed in satellites from integrated circuits, solar cells, atomic clocks, and advanced materials. Over the past 25 years a new understanding of the relationship between quantum theory, theory and security, and computing has raised the possibility of exploiting \quantum information for computing and secure encryption key generation. The eld of quantum science exploits quantum states for processing and security applications. The power of quantum derives from the quantum nature of matter that allow algorithms with exponential speed-up when compared to the best-known classical algorithms. Quantum Key Distribution involves using quantum states, typically encoded into the phase or polarization of photons, to securely share the bits to be used to construct an encryption key. The theoretical security of quantum key distribution rests on the physical laws of quantum theory, unlike classical cryptography that relies on assumptions about the computational complexity of certain mathematical problems. In this paper we survey the state of quantum science and technology, summarizing the basic features of quantum processing and key distribution. We describe the potential for quantum computing and key distribution to support future NSS applications and missions, for both the ground and space segments. We conclude with a discussion of the current challenges with advancing quantum technology to meet these future needs.