skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates
Abstract We prove that$${{\,\textrm{poly}\,}}(t) \cdot n^{1/D}$$ poly ( t ) · n 1 / D -depth local random quantum circuits with two qudit nearest-neighbor gates on aD-dimensional lattice withnqudits are approximatet-designs in various measures. These include the “monomial” measure, meaning that the monomials of a random circuit from this family have expectation close to the value that would result from the Haar measure. Previously, the best bound was$${{\,\textrm{poly}\,}}(t)\cdot n$$ poly ( t ) · n due to Brandão–Harrow–Horodecki (Commun Math Phys 346(2):397–434, 2016) for$$D=1$$ D = 1 . We also improve the “scrambling” and “decoupling” bounds for spatially local random circuits due to Brown and Fawzi (Scrambling speed of random quantum circuits, 2012). One consequence of our result is that assuming the polynomial hierarchy ($${{\,\mathrm{\textsf{PH}}\,}}$$ PH ) is infinite and that certain counting problems are$$\#{\textsf{P}}$$ # P -hard “on average”, sampling within total variation distance from these circuits is hard for classical computers. Previously, exact sampling from the outputs of even constant-depth quantum circuits was known to be hard for classical computers under these assumptions. However the standard strategy for extending this hardness result to approximate sampling requires the quantum circuits to have a property called “anti-concentration”, meaning roughly that the output has near-maximal entropy. Unitary 2-designs have the desired anti-concentration property. Our result improves the required depth for this level of anti-concentration from linear depth to a sub-linear value, depending on the geometry of the interactions. This is relevant to a recent experiment by the Google Quantum AI group to perform such a sampling task with 53 qubits on a two-dimensional lattice (Arute in Nature 574(7779):505–510, 2019; Boixo et al. in Nate Phys 14(6):595–600, 2018) (and related experiments by USTC), and confirms their conjecture that$$O(\sqrt{n})$$ O ( n ) depth suffices for anti-concentration. The proof is based on a previous construction oft-designs by Brandão et al. (2016), an analysis of how approximate designs behave under composition, and an extension of the quasi-orthogonality of permutation operators developed by Brandão et al. (2016). Different versions of the approximate design condition correspond to different norms, and part of our contribution is to introduce the norm corresponding to anti-concentration and to establish equivalence between these various norms for low-depth circuits. For random circuits with long-range gates, we use different methods to show that anti-concentration happens at circuit size$$O(n\ln ^2 n)$$ O ( n ln 2 n ) corresponding to depth$$O(\ln ^3 n)$$ O ( ln 3 n ) . We also show a lower bound of$$\Omega (n \ln n)$$ Ω ( n ln n ) for the size of such circuit in this case. We also prove that anti-concentration is possible in depth$$O(\ln n \ln \ln n)$$ O ( ln n ln ln n ) (size$$O(n \ln n \ln \ln n)$$ O ( n ln n ln ln n ) ) using a different model.  more » « less
Award ID(s):
1729369
PAR ID:
10411433
Author(s) / Creator(s):
;
Publisher / Repository:
Springer Science + Business Media
Date Published:
Journal Name:
Communications in Mathematical Physics
Volume:
401
Issue:
2
ISSN:
0010-3616
Page Range / eLocation ID:
p. 1531-1626
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the running time of Arthur. We provide new Merlin–Arthur proof systems for some key problems in fine-grained complexity. In several cases our proof systems have optimal running time. Our main results include:Certifying that a list ofnintegers has no 3-SUM solution can be done in Merlin–Arthur time$$\tilde{O}(n)$$ O ~ ( n ) . Previously, Carmosino et al. [ITCS 2016] showed that the problem has a nondeterministic algorithm running in$$\tilde{O}(n^{1.5})$$ O ~ ( n 1.5 ) time (that is, there is a proof system with proofs of length$$\tilde{O}(n^{1.5})$$ O ~ ( n 1.5 ) and a deterministic verifier running in$$\tilde{O}(n^{1.5})$$ O ~ ( n 1.5 ) time).Counting the number ofk-cliques with total edge weight equal to zero in ann-node graph can be done in Merlin–Arthur time$${\tilde{O}}(n^{\lceil k/2\rceil })$$ O ~ ( n k / 2 ) (where$$k\ge 3$$ k 3 ). For oddk, this bound can be further improved for sparse graphs: for example, counting the number of zero-weight triangles in anm-edge graph can be done in Merlin–Arthur time$${\tilde{O}}(m)$$ O ~ ( m ) . Previous Merlin–Arthur protocols by Williams [CCC’16] and Björklund and Kaski [PODC’16] could only countk-cliques in unweighted graphs, and had worse running times for smallk.Computing the All-Pairs Shortest Distances matrix for ann-node graph can be done in Merlin–Arthur time$$\tilde{O}(n^2)$$ O ~ ( n 2 ) . Note this is optimal, as the matrix can have$$\Omega (n^2)$$ Ω ( n 2 ) nonzero entries in general. Previously, Carmosino et al. [ITCS 2016] showed that this problem has an$$\tilde{O}(n^{2.94})$$ O ~ ( n 2.94 ) nondeterministic time algorithm.Certifying that ann-variablek-CNF is unsatisfiable can be done in Merlin–Arthur time$$2^{n/2 - n/O(k)}$$ 2 n / 2 - n / O ( k ) . We also observe an algebrization barrier for the previous$$2^{n/2}\cdot \textrm{poly}(n)$$ 2 n / 2 · poly ( n ) -time Merlin–Arthur protocol of R. Williams [CCC’16] for$$\#$$ # SAT: in particular, his protocol algebrizes, and we observe there is no algebrizing protocol fork-UNSAT running in$$2^{n/2}/n^{\omega (1)}$$ 2 n / 2 / n ω ( 1 ) time. Therefore we have to exploit non-algebrizing properties to obtain our new protocol.Certifying a Quantified Boolean Formula is true can be done in Merlin–Arthur time$$2^{4n/5}\cdot \textrm{poly}(n)$$ 2 4 n / 5 · poly ( n ) . Previously, the only nontrivial result known along these lines was an Arthur–Merlin–Arthur protocol (where Merlin’s proof depends on some of Arthur’s coins) running in$$2^{2n/3}\cdot \textrm{poly}(n)$$ 2 2 n / 3 · poly ( n ) time.Due to the centrality of these problems in fine-grained complexity, our results have consequences for many other problems of interest. For example, our work implies that certifying there is no Subset Sum solution tonintegers can be done in Merlin–Arthur time$$2^{n/3}\cdot \textrm{poly}(n)$$ 2 n / 3 · poly ( n ) , improving on the previous best protocol by Nederlof [IPL 2017] which took$$2^{0.49991n}\cdot \textrm{poly}(n)$$ 2 0.49991 n · poly ( n ) time. 
    more » « less
  2. Abstract The elliptic flow$$(v_2)$$ ( v 2 ) of$${\textrm{D}}^{0}$$ D 0 mesons from beauty-hadron decays (non-prompt$${\textrm{D}}^{0})$$ D 0 ) was measured in midcentral (30–50%) Pb–Pb collisions at a centre-of-mass energy per nucleon pair$$\sqrt{s_{\textrm{NN}}} = 5.02$$ s NN = 5.02  TeV with the ALICE detector at the LHC. The$${\textrm{D}}^{0}$$ D 0 mesons were reconstructed at midrapidity$$(|y|<0.8)$$ ( | y | < 0.8 ) from their hadronic decay$$\mathrm {D^0 \rightarrow K^-\uppi ^+}$$ D 0 K - π + , in the transverse momentum interval$$2< p_{\textrm{T}} < 12$$ 2 < p T < 12  GeV/c. The result indicates a positive$$v_2$$ v 2 for non-prompt$${{\textrm{D}}^{0}}$$ D 0 mesons with a significance of 2.7$$\sigma $$ σ . The non-prompt$${{\textrm{D}}^{0}}$$ D 0 -meson$$v_2$$ v 2 is lower than that of prompt non-strange D mesons with 3.2$$\sigma $$ σ significance in$$2< p_\textrm{T} < 8~\textrm{GeV}/c$$ 2 < p T < 8 GeV / c , and compatible with the$$v_2$$ v 2 of beauty-decay electrons. Theoretical calculations of beauty-quark transport in a hydrodynamically expanding medium describe the measurement within uncertainties. 
    more » « less
  3. Abstract The total charm-quark production cross section per unit of rapidity$$\textrm{d}\sigma ({{\textrm{c}}\overline{\textrm{c}}})/\textrm{d}y$$ d σ ( c c ¯ ) / d y , and the fragmentation fractions of charm quarks to different charm-hadron species$$f(\textrm{c}\rightarrow {\textrm{h}}_{\textrm{c}})$$ f ( c h c ) , are measured for the first time in p–Pb collisions at$$\sqrt{s_\textrm{NN}} = 5.02~\text {Te}\hspace{-1.00006pt}\textrm{V} $$ s NN = 5.02 Te V at midrapidity ($$-0.96<0.04$$ - 0.96 < y < 0.04 in the centre-of-mass frame) using data collected by ALICE at the CERN LHC. The results are obtained based on all the available measurements of prompt production of ground-state charm-hadron species:$$\textrm{D}^{0}$$ D 0 ,$$\textrm{D}^{+}$$ D + ,$$\textrm{D}_\textrm{s}^{+}$$ D s + , and$$\mathrm {J/\psi }$$ J / ψ mesons, and$$\Lambda _\textrm{c}^{+}$$ Λ c + and$$\Xi _\textrm{c}^{0}$$ Ξ c 0 baryons. The resulting cross section is$$ \textrm{d}\sigma ({{\textrm{c}}\overline{\textrm{c}}})/\textrm{d}y =219.6 \pm 6.3\;(\mathrm {stat.}) {\;}_{-11.8}^{+10.5}\;(\mathrm {syst.}) {\;}_{-2.9}^{+8.3}\;(\mathrm {extr.})\pm 5.4\;(\textrm{BR})\pm 4.6\;(\mathrm {lumi.}) \pm 19.5\;(\text {rapidity shape})+15.0\;(\Omega _\textrm{c}^{0})\;\textrm{mb} $$ d σ ( c c ¯ ) / d y = 219.6 ± 6.3 ( stat . ) - 11.8 + 10.5 ( syst . ) - 2.9 + 8.3 ( extr . ) ± 5.4 ( BR ) ± 4.6 ( lumi . ) ± 19.5 ( rapidity shape ) + 15.0 ( Ω c 0 ) mb , which is consistent with a binary scaling of pQCD calculations from pp collisions. The measured fragmentation fractions are compatible with those measured in pp collisions at$$\sqrt{s} = 5.02$$ s = 5.02 and 13 TeV, showing an increase in the relative production rates of charm baryons with respect to charm mesons in pp and p–Pb collisions compared with$$\mathrm {e^{+}e^{-}}$$ e + e - and$$\mathrm {e^{-}p}$$ e - p collisions. The$$p_\textrm{T}$$ p T -integrated nuclear modification factor of charm quarks,$$R_\textrm{pPb}({\textrm{c}}\overline{\textrm{c}})= 0.91 \pm 0.04\;\mathrm{(stat.)} ^{+0.08}_{-0.09}\;\mathrm{(syst.)} ^{+0.05}_{-0.03}\;\mathrm{(extr.)} \pm 0.03\;\mathrm{(lumi.)}$$ R pPb ( c c ¯ ) = 0.91 ± 0.04 ( stat . ) - 0.09 + 0.08 ( syst . ) - 0.03 + 0.05 ( extr . ) ± 0.03 ( lumi . ) , is found to be consistent with unity and with theoretical predictions including nuclear modifications of the parton distribution functions. 
    more » « less
  4. Abstract Let$$(h_I)$$ ( h I ) denote the standard Haar system on [0, 1], indexed by$$I\in \mathcal {D}$$ I D , the set of dyadic intervals and$$h_I\otimes h_J$$ h I h J denote the tensor product$$(s,t)\mapsto h_I(s) h_J(t)$$ ( s , t ) h I ( s ) h J ( t ) ,$$I,J\in \mathcal {D}$$ I , J D . We consider a class of two-parameter function spaces which are completions of the linear span$$\mathcal {V}(\delta ^2)$$ V ( δ 2 ) of$$h_I\otimes h_J$$ h I h J ,$$I,J\in \mathcal {D}$$ I , J D . This class contains all the spaces of the formX(Y), whereXandYare either the Lebesgue spaces$$L^p[0,1]$$ L p [ 0 , 1 ] or the Hardy spaces$$H^p[0,1]$$ H p [ 0 , 1 ] ,$$1\le p < \infty $$ 1 p < . We say that$$D:X(Y)\rightarrow X(Y)$$ D : X ( Y ) X ( Y ) is a Haar multiplier if$$D(h_I\otimes h_J) = d_{I,J} h_I\otimes h_J$$ D ( h I h J ) = d I , J h I h J , where$$d_{I,J}\in \mathbb {R}$$ d I , J R , and ask which more elementary operators factor throughD. A decisive role is played by theCapon projection$$\mathcal {C}:\mathcal {V}(\delta ^2)\rightarrow \mathcal {V}(\delta ^2)$$ C : V ( δ 2 ) V ( δ 2 ) given by$$\mathcal {C} h_I\otimes h_J = h_I\otimes h_J$$ C h I h J = h I h J if$$|I|\le |J|$$ | I | | J | , and$$\mathcal {C} h_I\otimes h_J = 0$$ C h I h J = 0 if$$|I| > |J|$$ | I | > | J | , as our main result highlights: Given any bounded Haar multiplier$$D:X(Y)\rightarrow X(Y)$$ D : X ( Y ) X ( Y ) , there exist$$\lambda ,\mu \in \mathbb {R}$$ λ , μ R such that$$\begin{aligned} \lambda \mathcal {C} + \mu ({{\,\textrm{Id}\,}}-\mathcal {C})\text { approximately 1-projectionally factors through }D, \end{aligned}$$ λ C + μ ( Id - C ) approximately 1-projectionally factors through D , i.e., for all$$\eta > 0$$ η > 0 , there exist bounded operatorsA, Bso thatABis the identity operator$${{\,\textrm{Id}\,}}$$ Id ,$$\Vert A\Vert \cdot \Vert B\Vert = 1$$ A · B = 1 and$$\Vert \lambda \mathcal {C} + \mu ({{\,\textrm{Id}\,}}-\mathcal {C}) - ADB\Vert < \eta $$ λ C + μ ( Id - C ) - A D B < η . Additionally, if$$\mathcal {C}$$ C is unbounded onX(Y), then$$\lambda = \mu $$ λ = μ and then$${{\,\textrm{Id}\,}}$$ Id either factors throughDor$${{\,\textrm{Id}\,}}-D$$ Id - D
    more » « less
  5. Abstract This paper presents the first measurement of$$\psi {(2S)}$$ ψ ( 2 S ) and$$\chi _{c1}(3872)$$ χ c 1 ( 3872 ) meson production within fully reconstructed jets. Each quarkonium state (tag) is reconstructed via its decay to the$${{J \hspace{-1.66656pt}/\hspace{-1.111pt}\psi }} $$ J / ψ ($$\rightarrow $$ $$\mu ^+\mu ^-$$ μ + μ - )$$\pi ^+\pi ^-$$ π + π - final state in the forward region using proton-proton collision data collected by the LHCb experiment at the center-of-mass-energy of$$13\text {TeV} $$ 13 TeV in 2016, corresponding to an integrated luminosity of$$1.64\,\text {\,fb} ^{-1} $$ 1.64 \,fb - 1 . The fragmentation function, presented as the ratio of the quarkonium-tag transverse momentum to the full jet transverse momentum ($$p_{\textrm{T}} (\text {tag})/p_{\textrm{T}} (\text {jet})$$ p T ( tag ) / p T ( jet ) ), is measured differentially in$$p_{\textrm{T}} (\text {jet})$$ p T ( jet ) and$$p_{\textrm{T}} (\text {tag})$$ p T ( tag ) bins. The distributions are separated into promptly produced quarkonia from proton-proton collisions and quarkonia produced from displacedb-hadron decays. While the displaced quarkonia fragmentation functions are in general well described by parton-shower predictions, the prompt quarkonium distributions differ significantly from fixed-order non-relativistic QCD (NRQCD) predictions followed by a QCD parton shower. 
    more » « less