ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A{\cal A} be a circuit architecture, and let HA{\cal H}_{\cal A} be the distribution of circuits in A{\cal A} whose gates are independently drawn from Haar measure. Random circuit sampling (RCS) is the task of receiving a circuit CC sampled from HA{\cal H}_{\cal A} and an error parameter ϵ>0\epsilon>0, then sampling from the distribution induced by CC, namely

Pr⁡(y)=∣⟨y∣C∣0⟩∣2\Pr(y)=|\langle y|C|0\rangle|^2

up to total variation distance ϵ\epsilon in time poly⁡(n,1/ϵ)\operatorname{poly}(n,1/\epsilon). Here nn is the number of qubits.

Quantum supremacy conjecture. There is no classical randomized algorithm that performs RCS to inverse-polynomial total variation-distance error.

This conjecture asserts the classical computational hardness of sampling from random quantum-circuit output distributions and is a central formulation of quantum computational supremacy. The supplied text gives no resolution evidence, so its status remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.