Related papers: Approximate t-designs in generic circuit architect…
The main aim of this work is to present an explicit construction of a 2-design of ${\rm U}(2)$, relying only on a tool that belongs to every physicists toolbox: the theory of angular momentum. Unitary designs are a rich and fundamental…
We consider one dimensional quantum circuits of the brickwork type, where the fundamental quantum gate is dual unitary. Such models are solvable: the dynamical correlation functions of the infinite temperature ensemble can be computed…
We show that the depth of quantum circuits in the realistic architecture where a classical controller determines which local interactions to apply on the kD grid Z^k where k >= 2 is the same (up to a constant factor) as in the standard…
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in…
We continue the study of the approximate $k$-wise independence of random reversible circuits as permutations of $\{\pm1\}^n$. Our main result is the first construction of a natural class of random reversible circuits with a sublinear-in-$n$…
A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition…
The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear…
Batch codes serve as critical tools for load balancing in distributed storage systems. While numerous constructions exist for specific batch sizes t, current methodologies predominantly rely on code dimension parameters, limiting their…
We introduce an $\varepsilon$-approximate unitary 2-design that is compatible with the structure of p- and q-quadratures in continuous-variable (CV) quantum systems. The design unitaries are defined on a finite-dimensional discretisation of…
In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the $t$-adesign, which was coined by Cunsheng Ding in 2015. It is clear that $2$-adesigns are a kind of partially balanced…
Quantum pseudorandomness, also known as unitary designs, comprise a powerful resource for quantum computation and quantum engineering. While it is known in theory that pseudorandom unitary operators can be constructed efficiently, realizing…
Given an open set $T\subset [-1,1)$, we introduce the concepts of $T$-avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set $T$. We show that certain codes found in the minimal vectors of the…
The generation of $k$-designs (pseudorandom distributions that emulate the Haar measure up to $k$ moments) with local quantum circuit ensembles is a problem of fundamental importance in quantum information and physics. Despite the extensive…
Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any…
We explore the implementation of pseudo-random single-qubit rotations and multi-qubit pseudo-random circuits constructed only from Clifford gates and the T-gate, a phase rotation of pi/4. Such a gate set would be appropriate for…
We argue that the quantum-theoretical structures studied in several recent lines of research cannot be adequately described within the standard framework of quantum circuits. This is in particular the case whenever the combination of…
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…
A $k$-dominating set is a set $D$ of nodes of a graph such that, for each node $v$, there exists a node $w \in D$ at distance at most $k$ from $v$. Our aim is the deterministic distributed construction of small $T$-dominating sets in time…
Quantum algorithms promise quadratic or exponential speedups for applications in cryptography, chemistry and material sciences. The topologies of today's quantum computers offer limited connectivity, leading to significant overheads for…
A notion of $t$-designs in the symmetric group on $n$ letters was introduced by Godsil in 1988. In particular $t$-transitive sets of permutations form a $t$-design. We derive special lower bounds for $t=1$ and $t=2$ by a power moment…