⚛️ quantum physics

Efficient Exact Quantum Sampling from the Sun-Wootters Distribution for Optimal Polynomial Intersection

This paper presents a bounded-error polynomial-time quantum algorithm that efficiently samples from the Sun-Wootters distribution for Reed-Solomon Optimal Polynomial Intersection, thereby achieving strict worst-case improvements over Decoded Quantum Interferometry and asymptotically perfect solutions at limiting rates of $3/4$ and above.

Original authors: Sunghyeon Jo

Published 2026-07-21

📖 7 min read🧠 Deep dive

CC BY 4.0

Original authors: Sunghyeon Jo

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a detective trying to solve a massive, chaotic puzzle. You have a list of clues, but they are scattered across a city, and some clues are misleading. Your goal is to find the one specific combination of clues that fits together perfectly to reveal the hidden picture. In the world of computer science, this is like a "structured optimization problem," where you are looking for the best possible solution among billions of messy options.

For a long time, scientists have used a clever trick called "Decoded Quantum Interferometry" (DQI) to help solve these puzzles. Think of DQI as a super-smart detective who can look at all the clues at once, thanks to the weird, magical rules of quantum mechanics. However, this detective has a limit: they can only guarantee finding a "good enough" solution if the puzzle isn't too crowded. If the clues get too dense, the detective's success rate drops, following a curve known as the "semicircle law." It's like trying to find a needle in a haystack that keeps getting bigger; eventually, the needle just gets lost in the noise.

Recently, two researchers named Sun and Wootters discovered a mathematical map that suggests there should be a way to find the perfect needle even in these super-crowded haystacks. They proved that if you look at the clues in a very specific, fancy way (using something called a "Fourier-defined distribution"), you could theoretically solve these puzzles much better than the old detective method. But there was a huge catch: they couldn't figure out how to actually build a machine to use this map. It was like having a treasure map that said, "X marks the spot," but no one knew how to dig the hole without collapsing the whole mountain.

This paper, written by Sunghyeon Jo, answers that burning question. The author has built a quantum algorithm—a set of instructions for a quantum computer—that can actually follow Sun and Wootters' map. The paper proves that for a specific type of puzzle (called "Optimal Polynomial Intersection"), we can now efficiently sample from this new, better distribution. The result is a quantum detective that doesn't just guess; it finds solutions that are strictly better than the old limits, starting from a puzzle density of 0.6225 and reaching near-perfect solutions when the density hits 0.75. It's a bridge from "theoretically possible" to "actually doable," turning a mathematical promise into a working quantum tool.

The Detective's New Superpower

To understand how this works, let's go back to our detective. The old method (DQI) was like having a detective who could look at a group of clues, but if two different groups of clues looked the same, the detective would just pick one at random. This was okay, but it missed out on the subtle magic that happens when you look at all the matching groups together.

Sun and Wootters realized that the real magic happens when you add up the "quantum waves" of every single matching group of clues at the same time. Imagine a choir where every singer is singing a slightly different note. If you just listen to one singer, it's fine. But if you listen to the whole choir, the notes might cancel out the bad ones and amplify the good ones, creating a perfect harmony. This "harmony" is what the new distribution, $P_u$ , represents. It's a superposition of all the possible correct answers, weighted perfectly to give the best result.

The problem was that calculating this harmony is incredibly hard. It's like trying to record every singer in a stadium at once without the microphones getting confused. Sun and Wootters showed the math worked, but they asked, "Can we actually build the microphone system?"

The Magic of "Coherent Fiber Summation"

Sunghyeon Jo's paper says, "Yes, we can." The secret sauce is a technique called "coherent fiber summation."

Imagine the clues are organized into "syndromes." A syndrome is like a fingerprint left behind by a specific type of error. In the old days, if a fingerprint matched several different error patterns, the computer would have to pick one. But Jo's algorithm is smarter. It uses a "complete list decoder," which is like a master librarian who can instantly list every book (or error pattern) that matches a specific fingerprint.

Here is the clever part: instead of picking one book, the quantum computer puts all the matching books into a superposition (a quantum state where they all exist at once). Then, it uses a "reversible indexer" to line them up perfectly. Think of it as a magical sorting machine that takes a messy pile of matching clues and arranges them into a neat, fixed-length row.

Once they are lined up, the computer performs a "uniform list-index projection." This is the quantum equivalent of asking, "If I look at this row of books, what is the chance I see the first one?" Because the computer has lined them up perfectly, this question allows it to sum up the "quantum waves" of all the books in that row simultaneously. This preserves the delicate phase information—the "harmony" that Sun and Wootters needed.

The Results: Beating the Limits

So, what does this actually achieve? The paper proves that for these specific puzzles, the new method works efficiently.

Beating the Semicircle: The old method had a hard limit. If the puzzle was too dense, the success rate would drop. Jo's algorithm breaks this limit. For any puzzle density (rate) starting from 0.6225, the new method guarantees a strictly better success rate than the old "semicircle" limit. It's like finding a needle in a haystack that is 62.25% full of hay, whereas the old method would have given up.
Perfect Solutions at 3/4: Even more impressive, when the puzzle density reaches 0.75 (or 3/4), the algorithm can find a solution that is almost perfect (satisfaction ratio of $1 - o(1)$ ) with very high probability. This means that as the puzzles get bigger, the chance of finding the perfect answer approaches 100%.

The paper also addresses a rival approach by Horinaga and Yamakawa. While they have a different method that works for slightly different types of puzzles and fields, Jo's method is specifically designed to sample the exact distribution Sun and Wootters proposed, covering the range from 0.6225 up to the 0.75 threshold with a guarantee of "strict improvement" over the previous best.

Why This Matters

This isn't just about solving a math puzzle. It shows that we can take complex mathematical proofs about what could happen in the quantum world and turn them into actual, working algorithms. The paper proves that the "Sun–Wootters distribution" isn't just a theoretical ghost; it's a real target we can hit with a quantum computer.

By using "coherent list decoding," the author has shown that we don't need to guess which solution is best. We can let the quantum computer do the heavy lifting of summing up all the possibilities, filtering out the noise, and leaving us with the perfect answer. It's a significant step forward in showing that quantum computers can solve optimization problems that were previously thought to be too hard, even for the best classical computers.

In short, Sunghyeon Jo has built the microphone system for the choir. Now, we can finally hear the perfect harmony that Sun and Wootters promised, and it sounds like a solution to some of the hardest puzzles in computer science.

Technical Summary: Efficient Exact Quantum Sampling from the Sun–Wootters Distribution for Optimal Polynomial Intersection

Problem Statement
The paper addresses the Optimal Polynomial Intersection (OPI) problem, a structured optimization task where the goal is to find a polynomial $Q$ of degree less than $n$ that satisfies $Q(\alpha_i) \in S_i$ for the maximum number of indices $i$ , given distinct points $\alpha_i \in \mathbb{F}_p$ and subsets $S_i \subseteq \mathbb{F}_p$ .

While Decoded Quantum Interferometry (DQI) provides a quantum algorithm for OPI with a satisfaction guarantee governed by the semicircle law, Sun and Wootters [SW26] recently established an existential improvement. They proved that for balanced OPI over prime fields, a specific Fourier-defined distribution $P_u$ yields a strict worst-case improvement starting at rate $r = n/m \approx 0.6225$ and asymptotically perfect solutions ( $1-o(1)$ ) from rate $r \approx 0.7496$ . However, they left open the algorithmic question of whether $P_u$ can be sampled efficiently in polynomial time. This paper provides an affirmative answer for a specific regime of parameters.

Methodology
The core contribution is a bounded-error polynomial-time quantum sampler for the Sun–Wootters distribution $P_u$ . The algorithm operates by coherently summing the amplitudes of all low-weight errors within a specific syndrome class (fiber), preserving the complex phase cancellations that define $P_u$ .

The technical workflow proceeds as follows:

Fourier-Domain State Preparation: The algorithm begins by preparing a superposition of low-weight errors $|y\rangle$ and their syndromes $|Hy\rangle$ , where $H$ is the parity-check map of the dual code. The amplitudes are products of local Fourier coefficients.
Coherent Fiber Summation: Unlike standard decoding which selects a single error, the Sun–Wootters state requires a coherent sum over all errors $y$ $y$ sharing the same syndrome $s$ $s$ .
- The dual code of the OPI instance is identified as a Generalized Reed–Solomon (GRS) code.
- A deterministic complete list decoder (based on Chatterjee, Harsha, and Kumar [CHK26]) is used to enumerate all candidate errors in each syndrome fiber up to a radius $\ell$ .
- The algorithm employs a canonical reversible indexing circuit. It maps each valid error in a fiber to a fixed index in a list padded to a global length $L$ .
- By projecting the list-index register onto a uniform state (via Hadamard transform and measurement), the algorithm implements a coherent sum: $\sum_{y: Hy=s} a_y |y\rangle \to (\sum_{y: Hy=s} a_y) |s\rangle$ . This preserves the relative phases and cancellation patterns essential to $P_u$ .
Postselection and Inverse Transform: The algorithm succeeds conditionally on measuring a specific "match" flag. Upon success, an inverse Quantum Fourier Transform (QFT) is applied to the syndrome register, yielding a sample from $P_u$ .

Key Contributions

Exact Sampling Circuit: The authors derive a finite, exact circuit identity that prepares the normalized Sun–Wootters syndrome state exactly, conditioned on a successful list-index measurement.
Polynomial Complexity: By utilizing the deterministic list decoding of GRS codes and the Sun–Wootters denominator estimate, the authors prove that both the list size and the postselection overhead are polynomial in the input size, provided the target radius is strictly below the dual Johnson radius.
Robustness: The paper demonstrates that a finite-precision implementation achieves any prescribed inverse-polynomial total-variation error, ensuring the algorithm is robust to gate synthesis errors.

Results
The paper establishes two primary algorithmic consequences for balanced prime-field Reed–Solomon OPI instances ( $m \to \infty$ , density $\rho \approx 1/2$ ):

Strict Worst-Case Improvement: For any fixed limiting rate $0.6225 \le r < 1$ , there exists a uniform polynomial-time quantum algorithm whose expected satisfaction ratio strictly exceeds the DQI semicircle value by a constant depending on $r$ . This realizes the improvement predicted by Sun and Wootters.
Asymptotically Perfect Solutions: For any limiting rate $r \ge 3/4$ , the algorithm outputs a polynomial with satisfaction ratio $1 - o(1)$ with probability $1 - o(1)$ . This includes the limiting Johnson point $r=3/4$ .

The results rely on the Sun–Wootters exponent condition (Equation 17 in the paper) being strictly satisfied. The authors provide rational certificates verifying that this condition holds for the specified rate ranges.

Significance and Claims
The paper claims to resolve the open question posed by Sun and Wootters regarding the efficient sampling of their distribution. It demonstrates that the theoretical improvement over the semicircle law is not merely existential but algorithmically realizable via quantum interference, provided the problem parameters lie within the Johnson radius of the dual code.

The authors position their work alongside concurrent independent work by Horinaga and Yamakawa [HY26]. While Horinaga and Yamakawa achieve exact satisfaction at rates strictly above $3/4$ using a different Regev-like construction, this paper specifically targets the Sun–Wootters distribution, achieving the strict improvement threshold at the lower bound of $0.6225$ and including the limiting point $r=3/4$ in its high-probability guarantee. The work highlights that coherent list-index projection can convert classical list decoding into a quantum amplitude summation tool, enabling exact sampling of distributions defined by interference patterns that are otherwise difficult to access.

The Detective's New Superpower

The Magic of "Coherent Fiber Summation"

The Results: Beating the Limits

Why This Matters

Technical Summary: Efficient Exact Quantum Sampling from the Sun–Wootters Distribution for Optimal Polynomial Intersection

More like this