Related papers: Unitary $2$-designs from random $X$- and $Z$-diago…
We prove that local random quantum circuits acting on n qubits composed of O(t^{10} n^2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design…
One limitation of the variational quantum eigensolver algorithm is the large number of measurement steps required to estimate different terms in the Hamiltonian of interest. Unitary partitioning reduces this overhead by transforming the…
For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…
The capacity to custom tailor the properties of quantum matter and materials is a central requirement for enlarging their range of possible functionalities. A particularly promising route is the use of driving protocols to engineer specific…
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…
We study the problem of efficiently learning an unknown $n$-qubit unitary channel in diamond distance given query access. We present a general framework showing that if Pauli operators remain low-complexity under conjugation by a unitary,…
With a focus on universal quantum computing for quantum simulation, and through the example of lattice gauge theories, we introduce rather general quantum algorithms that can efficiently simulate certain classes of interactions consisting…
The minimum aberration criterion has been frequently used in the selection of fractional factorial designs with nominal factors. For designs with quantitative factors, however, level permutation of factors could alter their geometrical…
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…
Gluing theorem for random unitaries [Schuster, Haferkamp, Huang, QIP 2025] have found numerous applications, including designing low depth random unitaries [Schuster, Haferkamp, Huang, QIP 2025], random unitaries in ${\sf QAC0}$ [Foxman,…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the…
Constructing general programmable circuits to be able to run any given unitary operator efficiently on a quantum processor is of fundamental importance. We present a new quantum circuit design technique resulting two general programmable…
A robust control over quantum dynamics is of paramount importance for quantum technologies. Many of the existing control techniques are based on smooth Hamiltonian modulations involving repeated calculations of basic unitaries resulting in…
We introduce a method to perform imaginary time evolution in a controllable quantum system using measurements and conditional unitary operations. By performing a sequence of weak measurements based on the desired Hamiltonian constructed by…
We develop and demonstrate a technique to engineer universal unitary baths in quantum systems. Using the correspondence between unitary decoherence due to ambient environmental noise and errors in a control system for quantum bits, we show…
We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a…
We propose a method for enacting the unitary time propagation of two interacting neutrons at leading order of chiral effective field theory by efficiently encoding the nuclear dynamics into a single multi-level quantum device. The emulated…
Decomposing complex unitary evolution into a series of constituent components is a cornerstone of practical quantum information processing. While the decompostion of an $n\times n$ unitary into a series of $2\times2$ subunitaries is well…
We put forward a new, versatile and highly-scalable experimental setup for the realization of discrete two-dimensional quantum random walks with a single-qubit coin and tunable degree of decoherence. The proposed scheme makes use of a small…