Quantum Supremacy in Specific Algorithms

Start writing here...

Great topic! Quantum supremacy refers to the point at which a quantum computer can perform a computation that is infeasible for any classical computer, within a reasonable amount of time.

Let’s focus on quantum supremacy in the context of specific algorithms—because this is where things get interesting and concrete.

🔹 What Is Quantum Supremacy?

• Definition: Quantum supremacy is not necessarily about doing something useful, but rather about doing anything that a classical computer can’t do efficiently.
• Landmark: In 2019, Google claimed quantum supremacy with its 53-qubit processor "Sycamore", solving a very specific problem—sampling the output of a pseudo-random quantum circuit—in about 200 seconds. They claimed a classical supercomputer would take ~10,000 years for the same task.

🔹 Supremacy via Specific Algorithms

Let’s break it down by notable algorithms where quantum advantage (or eventual supremacy) is expected or already hinted at:

1. Random Circuit Sampling (RCS)

• Used in Google's supremacy experiment.
• Involves running a quantum circuit with random gates and sampling the output probabilities.
• Not practically useful, but extremely hard to simulate classically due to the exponential growth of Hilbert space.
• Why supremacy here? Classical simulation scales as 2n2^n with qubit count; quantum devices do it naturally.

2. Shor’s Algorithm (Factoring)

• Exponential speedup over classical algorithms for factoring large integers.
• Could theoretically break RSA encryption if scaled.
• No current quantum device can run Shor’s on large numbers, but once it can—boom, practical quantum supremacy.
• Requires error-corrected, fault-tolerant qubits (still years away).

3. Grover’s Algorithm (Search)

• Provides a quadratic speedup for unstructured search problems.
• Not quite supremacy (since quadratic isn’t exponential), but shows advantage in specific domains.
• Example: Searching unsorted databases, solving NP problems faster than brute-force.

4. Boson Sampling

• Similar in spirit to random circuit sampling but uses non-interacting photons in linear optical networks.
• Aaronson & Arkhipov (2011) proposed this as a route to quantum supremacy.
• Very limited practical use, but incredibly hard to simulate classically.
• Experiments by USTC (China) with Jiuzhang photonic quantum computer claimed supremacy here.

5. Quantum Simulation of Physical Systems

• Algorithms for simulating molecular energies, quantum chemistry, and many-body physics show quantum speedups.
• Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) are prominent.
• Advantage will become clearer as quantum hardware improves.
• Usefulness + potential supremacy in specialized fields (e.g., material science, drug discovery).

🔹 Caveats and Ongoing Debate

• Google’s supremacy claim was challenged by IBM, saying classical simulations could be optimized.
• Quantum advantage (a more practical term) is preferred when referring to solving useful problems faster, not just toy problems.
• We’re still in early days—most supremacy demonstrations don’t yet translate to real-world breakthroughs.

🔹 TL;DR

Want to explore VQE vs QPE, or maybe dive into Google’s supremacy setup in detail?