Unitary k-designs from random number-conserving quantum circuits
- URL: http://arxiv.org/abs/2306.01035v1
- Date: Thu, 1 Jun 2023 18:00:00 GMT
- Title: Unitary k-designs from random number-conserving quantum circuits
- Authors: Sumner N. Hearth, Michael O. Flynn, Anushya Chandran, and Chris R.
Laumann
- Abstract summary: Local random circuits scramble efficiently and accordingly have a range of applications in quantum information and quantum dynamics.
We show that finite moments cannot distinguish the ensemble that local random circuits generate from the Haar ensemble on the entire group of number conserving unitaries.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Local random circuits scramble efficiently and accordingly have a range of
applications in quantum information and quantum dynamics. With a global $U(1)$
charge however, the scrambling ability is reduced; for example, such random
circuits do not generate the entire group of number-conserving unitaries. We
establish two results using the statistical mechanics of $k$-fold replicated
circuits. First, we show that finite moments cannot distinguish the ensemble
that local random circuits generate from the Haar ensemble on the entire group
of number conserving unitaries. Specifically, the circuits form a $k_c$-design
with $k_c = O(L^d)$ for a system in $d$ spatial dimensions with linear
dimension $L$. Second, for $k < k_c$, the depth $\tau$ to converge to a
$k$-design scales as $\tau \gtrsim k L^{d+2}$. In contrast, without number
conservation $\tau \gtrsim k L^{d}$. The convergence of the circuit ensemble is
controlled by the low-energy properties of a frustration-free quantum
statistical model which spontaneously breaks $k$ $U(1)$ symmetries. The
associated Goldstone modes are gapless and lead to the predicted scaling of
$\tau$. Our variational bounds hold for arbitrary spatial and qudit dimensions;
we conjecture they are tight.
Related papers
- Incompressibility and spectral gaps of random circuits [2.359282907257055]
reversible and quantum circuits form random walks on the alternating group $mathrmAlt (2n)$ and unitary group $mathrmSU (2n)$, respectively.
We prove that the gap for random reversible circuits is $Omega(n-3)$ for all $tgeq 1$, and the gap for random quantum circuits is $Omega(n-3)$ for $t leq Theta(2n/2)$.
arXiv Detail & Related papers (2024-06-11T17:23:16Z) - Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
We show how to reduce the geometry of degenerate states to the non-abelian connection $A$.
We find independent invariants associated with each triple of subspaces.
Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
arXiv Detail & Related papers (2024-04-04T06:39:28Z) - A Unified Framework for Uniform Signal Recovery in Nonlinear Generative
Compressed Sensing [68.80803866919123]
Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously.
Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples.
We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
arXiv Detail & Related papers (2023-09-25T17:54:19Z) - On the average-case complexity of learning output distributions of
quantum circuits [55.37943886895049]
We show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model.
This learning model is widely used as an abstract computational model for most generic learning algorithms.
arXiv Detail & Related papers (2023-05-09T20:53:27Z) - On the moments of random quantum circuits and robust quantum complexity [0.0]
We prove new lower bounds on the growth of robust quantum circuit complexity.
We show two bounds for random quantum circuits with local gates drawn from a subgroup of $SU(4)$.
arXiv Detail & Related papers (2023-03-29T18:06:03Z) - Random quantum circuits are approximate unitary $t$-designs in depth
$O\left(nt^{5+o(1)}\right)$ [0.0]
We show that random quantum circuits generate approximate unitary $t$-designs in depth $O(nt5+o(1))$.
Our techniques involve Gao's quantum union bound and the unreasonable effectiveness of the Clifford group.
arXiv Detail & Related papers (2022-03-30T18:02:08Z) - Random quantum circuits transform local noise into global white noise [118.18170052022323]
We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime.
For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially.
If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
arXiv Detail & Related papers (2021-11-29T19:26:28Z) - Quantum double aspects of surface code models [77.34726150561087]
We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry.
We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
arXiv Detail & Related papers (2021-06-25T17:03:38Z) - Improved spectral gaps for random quantum circuits: large local
dimensions and all-to-all interactions [0.0]
We show that $1D$ random quantum circuits have a spectral gap scaling as $Omega(n-1)$, provided that $t$ is small compared to the local dimension: $t2leq O(q)$.
Our second result is an unconditional spectral gap bounded below by $Omega(n-1log-1(n) t-alpha(q))$ for random quantum circuits with all-to-all interactions.
arXiv Detail & Related papers (2020-12-09T19:00:50Z) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z) - Epsilon-nets, unitary designs and random quantum circuits [0.11719282046304676]
Epsilon-nets and approximate unitary $t$-designs are notions of unitary operations relevant for numerous applications in quantum information and quantum computing.
We prove that for a fixed $d$ of the space, unitaries constituting $delta$-approx $t$-expanders form $epsilon$-nets for $tsimeqfracd5/2epsilon$ and $delta=left(fracepsilon3/2dright)d2$.
We show that approximate tdesigns can be generated
arXiv Detail & Related papers (2020-07-21T15:16:28Z)
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.