QAC0 Can Prepare Every Logarithmic-Qubit State
Lucas Gretta, Meghal Gupta, Malvika Raj Joshi
Abstract
QAC0 is the class of constant-depth poly(n)-ancilla circuits obtained by extending QNC0, the class of local circuits, to include nonlocal interactions via arbitrary width Toffoli gates. It is believed to be weaker than its counterpart, QNC0f, obtained by including arbitrary-width FANOUT gates instead (QAC0 ⊂eq QNC0f [Moo99]). In this note, we show that every O( n)-qubit state can be exactly and cleanly prepared by a poly(n)-ancilla QAC0 circuit. Previous known poly(n)-ancilla circuits for arbitrary such states are only known via additional access to either FANOUT or QRAM (indexing) gates [Ros21b, GGJ26b], neither of which are known to be in QAC0. Equivalently, prior constructions of arbitrary n-qubit states in QAC0 require doubly exponential size and we obtain an exponential factor improvement.
Create a lesson
Related papers
Parallel quantum channel discrimination and numerical ranges in tensor product subspaces
Adam Bílek, Paulina Lewandowska, Ryszard Kukulski
Asymptotically Good Quantum Locally Testable Codes
William Gay, Fernando Granha Jeronimo
All causally separable quantum processes are quantum circuits with classical control of causal order
Julian Wechs, Alastair A. Abbott, Cyril Branciard
Analytic leakage suppression with a single control field: fast two-qubit gates with tunable couplers
Lukas Heunisch, Michael J. Hartmann, Aashish A. Clerk
Procrastinating einselection in non-Markovian quantum dynamics
Michael J. Moody, Tara Kalsi, Agung Budiyono et al.
Quantum Entropy Contraction and Factorization from Hypercontractivity
Li Gao, Lijun Wang