Epsilon-nets, unitary designs and random quantum circuits

• URL: http://arxiv.org/abs/2007.10885v3
• Date: Sun, 31 Oct 2021 14:25:01 GMT
• Title: Epsilon-nets, unitary designs and random quantum circuits
• Authors: Micha{\l} Oszmaniec, Adam Sawicki, Micha{\l} Horodecki
• Abstract summary: 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
• Score: 0.11719282046304676
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Epsilon-nets and approximate unitary $t$-designs are natural notions that capture properties of unitary operations relevant for numerous applications in quantum information and quantum computing. The former constitute subsets of unitary channels that are epsilon-close to any unitary channel in the diamond norm. The latter are ensembles of unitaries that (approximately) recover Haar averages of polynomials in entries of unitary channels up to order $t$. In this work we establish quantitative connections between these two notions. Specifically, we prove that, for a fixed dimension $d$ of the Hilbert space, unitaries constituting $\delta$-approximate $t$-expanders form $\epsilon$-nets for $t\simeq\frac{d^{5/2}}{\epsilon}$ and $\delta=\left(\frac{\epsilon^{3/2}}{d}\right)^{d^2}$. We also show that $\epsilon$-nets can be used to construct $\delta$-approximate unitary $t$-designs for $\delta= \epsilon t$. Finally, we prove that the degree of an exact unitary $t$-design necessary to obtain an $\epsilon$-net must grow at least fast as $\frac1\epsilon$ (for fixed $d$) and not slower than $d^2$ (for fixed $\epsilon$). This shows near optimality of our result connecting $t$-designs and $\epsilon$-nets. We apply our findings in the context of quantum computing. First, we show that that approximate t-designs can be generated by shallow random circuits formed from a set of universal two-qudit gates in the parallel and sequential local architectures. Our gate sets need not to be symmetric (i.e. contain gates together with their inverses) or consist of gates with algebraic entries. We also show a non-constructive version of the Solovay-Kitaev theorem for general universal gate sets. Our main technical contribution is a new construction of efficient polynomial approximations to the Dirac delta in the space of quantum channels, which can be of independent interest.

Related papers

• Random unitaries in extremely low depth [0.8680580889074451]
  We prove that random quantum circuits on any geometry, including a 1D line, can form approximate unitary designs over $n$ qubits in $log n$ depth. In a similar manner, we construct pseudorandom unitaries (PRUs) in 1D circuits in $textpoly log n $ depth, and in all-to-all-connected circuits in $textpoly log log n $ depth.
  arXiv  Detail & Related papers  (2024-07-10T15:27:48Z)
• 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)
• Efficient Unitary T-designs from Random Sums [0.6640968473398456]
  Unitary $T$-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. We provide a new construction of $T$-designs via random matrix theory using $tildeO(T2 n2)$ quantum gates.
  arXiv  Detail & Related papers  (2024-02-14T17:32:30Z)
• 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)
• Unitary k-designs from random number-conserving quantum circuits [0.0]
  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.
  arXiv  Detail & Related papers  (2023-06-01T18:00:00Z)
• 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)
• Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies [68.93512627479197]
  We study quantum Ordered Binary Decision Diagrams($OBDD$) model. We prove lower bounds and upper bounds for OBDD with arbitrary order of input variables. We extend hierarchy for read$k$-times Ordered Binary Decision Diagrams ($k$-OBDD$) of width.
  arXiv  Detail & Related papers  (2022-04-22T12:37:56Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• 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)
• An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
  We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
  arXiv  Detail & Related papers  (2020-08-24T06:50:57Z)

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.