Random Unitaries in Constant (Quantum) Time

• URL: http://arxiv.org/abs/2508.11487v3
• Date: Fri, 26 Sep 2025 01:37:23 GMT
• Title: Random Unitaries in Constant (Quantum) Time
• Authors: Ben Foxman, Natalie Parham, Francisca Vasconcelos, Henry Yuen,
• Abstract summary: We show that unitary designs and PRUs can be efficiently constructed in several well-studied models of quantum computation.<n>Results demonstrate that unitary designs and PRUs can be constructed in much weaker circuit models than previously thought.
• Score: 0.8516351290711953
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 $\Theta(\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.

Related papers

• Coined Quantum Walks on Complex Networks for Quantum Computers [2.2336243882030025]
  In complex networks, the coin and shift operators depend on the varying degrees of the nodes.<n>We implement the circuit using Qmod, a high-level quantum programming language.<n>We execute the proposed circuits on the ibm_torino superconducting quantum processor for Watts-Strogatz models.
  arXiv  Detail & Related papers  (2025-12-18T10:55:55Z)
• Learning shallow quantum circuits with many-qubit gates [1.879968161594709]
  We present the first computationally-efficient algorithm for average-case learning of shallow quantum circuits with many-qubit gates.<n>We show that the learned unitary circuits can be efficiently synthesized in poly-logarithmic depth.
  arXiv  Detail & Related papers  (2024-10-22T04:48:36Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.<n>We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.<n>We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Efficient implementation of discrete-time quantum walks on quantum computers [0.0]
  We propose an efficient and scalable quantum circuit implementing the discrete-time quantum walk (DTQW) model. For $t$ time-steps of the DTQW, the proposed circuit requires only $O(n2 + nt)$ two-qubit gates compared to the $O(n2 t)$ of the current most efficient implementation.
  arXiv  Detail & Related papers  (2024-02-02T19:11:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Comparing planar quantum computing platforms at the quantum speed limit [0.0]
  We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL) for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. We analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping.
  arXiv  Detail & Related papers  (2023-04-04T12:47:00Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Sample Complexity of Learning Quantum Circuits [4.329298109272386]
  We prove that physical quantum circuits are PAC learnable on a quantum computer via empirical risk minimization. Our results provide a valuable guide for quantum machine learning in both theory and experiment.
  arXiv  Detail & Related papers  (2021-07-19T18:00:04Z)
• Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns [0.0]
  Current quantum processors are noisy, have limited coherence and imperfect gate implementations. We present novel deterministic algorithms for compiling recurrent quantum circuit patterns in time. Our solution produces unmatched results on RyRz circuits.
  arXiv  Detail & Related papers  (2021-02-17T13:59:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.