Quantum supremacy conjecture for random circuit sampling
Statement
Let be a circuit architecture, and let be the distribution of circuits in whose gates are independently drawn from Haar measure. Random circuit sampling (RCS) is the task of receiving a circuit sampled from and an error parameter , then sampling from the distribution induced by , namely
up to total variation distance in time . Here 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.