Quantum supremacy, a term coined by John Preskill in 2012, refers to the point at which quantum computers can perform tasks beyond the reach of classical computers. Universal quantum computation, a theoretical concept where a quantum computer could efficiently solve any problem that a classical computer can solve, is a significant milestone in the field of quantum information processing.
In 2019, Google claimed to have achieved quantum supremacy with their 53-qubit quantum processor named Sycamore. They reported that Sycamore solved a specific problem in 200 seconds that would take the world's fastest supercomputer, Summit, approximately 10,000 years to solve. This demonstration of quantum supremacy was a groundbreaking moment in the field of quantum computing.
However, the term "quantum supremacy" has been met with some controversy. Critics argue that the term itself implies a hierarchy between quantum and classical computing, which may not be the most accurate representation of the situation. Additionally, there are ongoing debates about the specific definition of quantum supremacy and whether the Sycamore experiment truly meets all the criteria to claim this milestone.
From a theoretical perspective, achieving universal quantum computation, where a quantum computer can efficiently solve any problem that a classical computer can solve, remains an open question. While significant progress has been made in developing quantum algorithms that outperform classical algorithms in certain tasks, the full potential of quantum computers has not yet been realized.
While the Sycamore experiment by Google marked a significant advancement in the field of quantum computing and raised important questions about the capabilities of quantum computers, the achievement of universal quantum computation, and thus quantum supremacy in its truest sense, remains an ongoing area of research and exploration.
Other recent questions and answers regarding EITC/QI/QIF Quantum Information Fundamentals:
- How the quantum negation gate (quantum NOT or Pauli-X gate) operates?
- Why is the Hadamard gate self-reversible?
- If measure the 1st qubit of the Bell state in a certain basis and then measure the 2nd qubit in a basis rotated by a certain angle theta, the probability that you will obtain projection to the corresponding vector is equal to the square of sine of theta?
- How many bits of classical information would be required to describe the state of an arbitrary qubit superposition?
- How many dimensions has a space of 3 qubits?
- Will the measurement of a qubit destroy its quantum superposition?
- Can quantum gates have more inputs than outputs similarily as classical gates?
- Does the universal family of quantum gates include the CNOT gate and the Hadamard gate?
- What is a double-slit experiment?
- Is rotating a polarizing filter equivalent to changing the photon polarization measurement basis?
View more questions and answers in EITC/QI/QIF Quantum Information Fundamentals