DeepAI AI Chat
Log In Sign Up

Fine-grained quantum supremacy of the one-clean-qubit model

by   Tomoyuki Morimae, et al.
Kyoto University

The one-clean-qubit model (or the DQC1 model) is a restricted model of quantum computing where all but a single input qubits are maximally mixed. It is known that output probability distributions of the DQC1 model cannot be classically sampled in polynomial-time unless the polynomial-time hierarchy collapses. In this paper, we show that even superpolynomial-time and exponential-time classical samplings are impossible under certain fine-grained complexity conjectures. We also show similar fine-grained quantum supremacy results for the Hadamard-classical circuit with one-qubit (HC1Q) model, which is another sub-universal model with a classical circuit sandwiched by two Hadamard layers.


page 1

page 2

page 3

page 4


Fine-grained quantum computational supremacy

It is known that several sub-universal quantum computing models cannot b...

Efficiently generating ground states is hard for postselected quantum computation

Although quantum computing is expected to outperform universal classical...

Complexity of Simon's problem in classical sense

Simon's problem is a standard example of a problem that is exponential i...

Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy

It is a long-standing open problem whether quantum computing can be veri...

Fine-Grained View on Bribery for Group Identification

Given a set of agents qualifying or disqualifying each other, group iden...

Manufacturing Pathway and Experimental Demonstration for Nanoscale Fine-Grained 3-D Integrated Circuit Fabric

At sub-20nm technologies CMOS scaling faces severe challenges primarily ...