Random Unitaries in Constant (Quantum) Time
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909806274543616 |
|---|---|
| author | Foxman, Ben Parham, Natalie Vasconcelos, Francisca Yuen, Henry |
| author_facet | Foxman, Ben Parham, Natalie Vasconcelos, Francisca Yuen, Henry |
| contents | Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitary designs and pseudorandom unitaries (PRUs) using $Θ(\log \log n)$-depth unitary circuits with two-qubit gates.
In this work, we show that unitary designs and PRUs can be efficiently constructed in several well-studied models of $\textit{constant-time}$ quantum computation (i.e., the time complexity on the quantum computer is independent of the system size). These models are constant-depth circuits augmented with certain nonlocal operations, such as (a) many-qubit TOFFOLI gates, (b) many-qubit FANOUT gates, or (c) mid-circuit measurements with classical feedforward control. Recent advances in quantum computing hardware suggest experimental feasibility of these models in the near future.
Our results demonstrate that unitary designs and PRUs can be constructed in much weaker circuit models than previously thought. Furthermore, our construction of PRUs in constant-depth with many-qubit TOFFOLI gates shows that, under cryptographic assumptions, there is no polynomial-time learning algorithm for the circuit class $\mathsf{QAC}^0$. Finally, our results suggest a new approach towards proving that PARITY is not computable in $\mathsf{QAC}^0$, a long-standing question in quantum complexity theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_11487 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Random Unitaries in Constant (Quantum) Time Foxman, Ben Parham, Natalie Vasconcelos, Francisca Yuen, Henry Quantum Physics Computational Complexity Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitary designs and pseudorandom unitaries (PRUs) using $Θ(\log \log n)$-depth unitary circuits with two-qubit gates. In this work, we show that unitary designs and PRUs can be efficiently constructed in several well-studied models of $\textit{constant-time}$ quantum computation (i.e., the time complexity on the quantum computer is independent of the system size). These models are constant-depth circuits augmented with certain nonlocal operations, such as (a) many-qubit TOFFOLI gates, (b) many-qubit FANOUT gates, or (c) mid-circuit measurements with classical feedforward control. Recent advances in quantum computing hardware suggest experimental feasibility of these models in the near future. Our results demonstrate that unitary designs and PRUs can be constructed in much weaker circuit models than previously thought. Furthermore, our construction of PRUs in constant-depth with many-qubit TOFFOLI gates shows that, under cryptographic assumptions, there is no polynomial-time learning algorithm for the circuit class $\mathsf{QAC}^0$. Finally, our results suggest a new approach towards proving that PARITY is not computable in $\mathsf{QAC}^0$, a long-standing question in quantum complexity theory. |
| title | Random Unitaries in Constant (Quantum) Time |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2508.11487 |