Non-Haar random circuits form unitary designs as fast as Haar random circuits

• URL: http://arxiv.org/abs/2504.07390v1
• Date: Thu, 10 Apr 2025 02:19:46 GMT
• Title: Non-Haar random circuits form unitary designs as fast as Haar random circuits
• Authors: Toshihiro Yada, Ryotaro Suzuki, Yosuke Mitsuhashi, Nobuyuki Yoshioka,
• Abstract summary: We prove that the circuit depths required for general non-Haar random circuits to form unitary designs are upper bounded by those for the corresponding Haar random circuits.<n>Our work lays the foundation for flexible and robust randomness generation in real-world experiments, and offers new insights into chaotic dynamics in complex quantum systems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The unitary design formation in random circuits has attracted considerable attention due to its wide range of practical applications and relevance to fundamental physics. While the formation rates in Haar random circuits have been extensively studied in previous works, it remains an open question how these rates are affected by the choice of local randomizers. In this work, we prove that the circuit depths required for general non-Haar random circuits to form unitary designs are upper bounded by those for the corresponding Haar random circuits, up to a constant factor independent of the system size. This result is derived in a broad range of circuit structures, including one- and higher-dimensional lattices, geometrically non-local configurations, and even extremely shallow circuits with patchwork architectures. We provide specific applications of these results in randomized benchmarking and random circuit sampling, and also discuss their implications for quantum many-body physics. Our work lays the foundation for flexible and robust randomness generation in real-world experiments, and offers new insights into chaotic dynamics in complex quantum systems.

Related papers

• On the complexity of sampling from shallow Brownian circuits [0.0]
  We study a constant-time Brownian circuit model which shares many similarities with constant-depth random quantum circuits. We show that the output distributions of Brownian circuits at shallow depths follow a Porter-Thomas distribution, just like in the case of deep circuits. We discover that for these circuits, while the quantum computer typically scores within a constant factor of the expected value, the classical spoofer suffers from an exponentially larger variance.
  arXiv  Detail & Related papers  (2024-11-06T19:00:00Z)
• More global randomness from less random local gates [0.26388783516590225]
  We prove that one-dimensional structured random circuits with non-Haar random local gates can exhibit substantially more global randomness compared to Haar random circuits with the same underlying circuit architecture. Our findings have applications in improving circuit depth bounds for randomized benchmarking and the generation of approximate unitary 2-designs from shallow random circuits.
  arXiv  Detail & Related papers  (2024-10-31T16:51:52Z)
• Measurement-induced entanglement and complexity in random constant-depth 2D quantum circuits [0.0]
  We analyse the entanglement structure of states generated by random constant-depth quantum circuits. We prove that macroscopic long-ranged entanglement is generated above some constant critical depth in several natural classes of circuit architectures.
  arXiv  Detail & Related papers  (2024-10-30T17:33:02Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Estimating the randomness of quantum circuit ensembles up to 50 qubits [9.775777593425452]
  We show that the ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.
  arXiv  Detail & Related papers  (2022-05-19T23:43:15Z)
• Escaping from the Barren Plateau via Gaussian Initializations in Deep Variational Quantum Circuits [63.83649593474856]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.<n>However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.<n>This result leads to a general standpoint that deep quantum circuits would not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Spin many-body phases in standard and topological waveguide QED simulators [68.8204255655161]
  We study the many-body behaviour of quantum spin models using waveguide QED setups. We find novel many-body phases different from the ones obtained in other platforms.
  arXiv  Detail & Related papers  (2021-06-22T09:44:20Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• The principle of majorization: application to random quantum circuits [68.8204255655161]
  Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
  arXiv  Detail & Related papers  (2021-02-19T16:07:09Z)
• Simulating hydrodynamics on noisy intermediate-scale quantum devices with random circuits [0.0]
  We show that random circuits provide tailor-made building blocks for simulating quantum many-body systems. Specifically, we propose an algorithm consisting of a random circuit followed by a trotterized Hamiltonian time evolution. We numerically demonstrate the algorithm by simulating the buildup of correlation functions in one- and two-dimensional quantum spin systems.
  arXiv  Detail & Related papers  (2020-12-04T19:00:00Z)
• Universal Gate Set for Continuous-Variable Quantum Computation with Microwave Circuits [101.18253437732933]
  We provide an explicit construction of a universal gate set for continuous-variable quantum computation with microwave circuits. As an application, we show that this architecture allows for the generation of a cubic phase state with an experimentally feasible procedure.
  arXiv  Detail & Related papers  (2020-02-04T16:51:59Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.