Quantum Computing @ MIT: The Past, Present, and Future of the Second Revolution in Computing
@article{Vasconcelos2020QuantumC,
title={Quantum Computing @ MIT: The Past, Present, and Future of the Second Revolution in Computing},
author={F. Vasconcelos},
journal={arXiv: Popular Physics},
year={2020}
}This article provides an overview of the history, theoretical basis, and different implementations of quantum computers. In Fall 2018, four MIT faculty -- Isaac Chuang, Dirk Englund, Aram Harrow, and William Oliver -- at the forefront of quantum computation and information research were interviewed. They provided personal perspectives on the development of the field, as well as insight to its near-term trajectory. There has been a lot of recent media hype surrounding quantum computation, so in…
One Citation
Investigating Hammock Networks on IBM Q
- Computer Science, Physics
- 2020
If and how much hammock networks might help in the quantum realm is tested using simulations on Open image in new window (unfortunately still gate-level constrained), and the preliminary findings are reported in this paper.
References
SHOWING 1-10 OF 24 REFERENCES
Simple quantum computer.
- Physics, Computer SciencePhysical review. A, Atomic, molecular, and optical physics
- 1995
We propose an implementation of a quantum computer to solve Deutsch's problem, which requires exponential time on a classical computer but only linear time with quantum parallelism. By using a…
Superconducting Circuits for Quantum Information: An Outlook
- PhysicsScience
- 2013
For the first time, physicists will have to master quantum error correction to design and operate complex active systems that are dissipative in nature, yet remain coherent indefinitely.
Quantum computation and quantum information
- PhysicsMathematical Structures in Computer Science
- 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal…
Experimental Implementation of Fast Quantum Searching
- Physics, Computer Science
- 1998
This provides the first complete experimental demonstration of loading an initial state into a quantum computer, performing a computation requiring fewer steps than on a classical computer, and then reading out the final state.
Quantum Computing
- Computer Science, Physics
- 2019
By harnessing such natural behavior (of qubits), quantum computing can run new, complex algorithms to process information more holistically and may one day lead to revolutionary breakthroughs in materials and drug discovery, the optimization of complex manmade systems, and artificial intelligence.
Ensemble quantum computing by NMR spectroscopy
- Computer ScienceProc. Natl. Acad. Sci. USA
- 1997
A new computational model is presented, which differs from a QC only in that the result of a measurement is the expectation value of the observable, rather than a random eigenvalue thereof, which can solve nondeterministic polynomial-time complete problems inPolynomial time.
The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Physics
- 1980
In this paper a microscopic quantum mechanical model of computers as represented by Turing machines is constructed. It is shown that for each numberN and Turing machineQ there exists a HamiltonianHNQ…
A fast quantum mechanical algorithm for database search
- Computer ScienceSTOC '96
- 1996
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Algorithms for quantum computation: discrete logarithms and factoring
- Computer ScienceProceedings 35th Annual Symposium on Foundations of Computer Science
- 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.