Related papers: A geometric approach to quantum circuit lower boun…
We elucidate the geometry of quantum adiabatic evolution. By minimizing the deviation from adiabaticity we find a Riemannian metric tensor underlying adiabatic evolution. Equipped with this tensor, we identify a unified geometric…
We introduce the first minimal and complete equational theory for quantum circuits. Hence, we show that any true equation on quantum circuits can be derived from simple rules, all of them being standard except a novel but intuitive one…
In this work we establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. Our bounds depend on the interplay between a pair of graphs: the Tanner graph of the set of measured Pauli…
A fundamental problem in quantum engineering is determining the lowest time required to ensure that all possible unitaries can be generated with the tools available, which is one of a number of possible quantum speed limits. We examine this…
We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the…
Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantum computing. One step in compiling a quantum circuit to some…
Quantum computing promises exponential improvements in solving large systems of partial differential equations (PDE), which forms a bottleneck in high-resolution computational fluid dynamics (CFD) simulations, in, among others, aerospace…
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $\mathcal{P}$ with a total of $n$ vertices. We discover many interesting observations. We give a necessary condition for a point being a…
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through a bijective mapping from N qubits to qudits with D = 2^N levels via rotations in U(2). For each of the universal gates (H, CNOT, and T), as…
We investigate the optimization of quantum control from a differential geometric perspective. In our approach, optimal control minimizes the cost associated with evolving a quantum state, with the cost quantified by the length of the…
We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and…
The design of quantum many body systems, which have to fulfill an extensive number of constraints, appears as a formidable challenge within the field of quantum simulation. Lattice gauge theories are a particular important class of quantum…
We prove that $poly(t) \cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the "monomial"…
We give an algorithm to compute the stable lengths of pseudo-Anosovs on the curve graph, answering a question of Bowditch. We also give a procedure to compute all invariant tight geodesic axes of pseudo-Anosovs. Along the way we show that…
For particles constrained on a curved surface, how to perform quantization within Dirac's canonical quantization scheme is a long-standing problem. On one hand, Dirac stressed that the Cartesian coordinate system has fundamental importance…
We give a metric characterization of the Euclidean sphere in terms of the lower bound of the sectional curvature and the length of the shortest closed geodesics.
We give a metric characterization of the Euclidean sphere in terms of the lower bound of the sectional curvature and the length of the shortest closed geodesics.
To accomplish a task within limited operation time typically requires an excess expense of energy, whose minimum is of practical importance for the optimal design in various applications, especially in the industrial separation of mixtures…
We show that any depth-$d$ circuit for determining whether an $n$-node graph has an $s$-to-$t$ path of length at most $k$ must have size $n^{\Omega(k^{1/d}/d)}$. The previous best circuit size lower bounds for this problem were…
The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Efficient circuits have been demonstrated in some cases but…