Related papers: A geometric approach to quantum circuit lower boun…
We prove several new results concerning action minimizing periodic orbits of Tonelli Lagrangian systems on an oriented closed surface $M$. More specifically, we show that for every energy larger than the maximal energy of a constant orbit…
Graph theoretical problems based on shortest paths are at the core of research due to their theoretical importance and applicability. This paper deals with the geodetic number which is a global measure for simple connected graphs and it…
Existence of a minimal measurable length, as an effective cutoff in the ultraviolet regime, is a common feature of all approaches to the quantum gravity proposal. It is widely believed that this length scale will be of the order of the…
In this paper we present an efficiently scaling quantum algorithm which finds the size of the maximum common edge subgraph for a pair of arbitrary graphs and thus provides a meaningful measure of graph similarity. The algorithm makes use of…
In models with large additional dimensions, the GUT scale can be lowered to values accessible by future colliders. Due to modification of the loop corrections from particles propagating into the extra dimensions, the logarithmic running of…
Qubit-efficient optimization studies how large combinatorial problems can be addressed with quantum circuits whose width is far smaller than the number of logical variables. In quadratic unconstrained binary optimization (QUBO), objective…
We prove a bound for the geodesic diameter of a subset of the unit ball in $\mathbb{R}^n$ described by a fixed number of quadratic equations and inequalities, which is polynomial in $n$, whereas the known bound for general degree is…
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of near-term quantum devices. We introduce…
We consider a model of computation motivated by possible limitations on quantum computers. We have a linear array of n wires, and we may perform operations only on pairs of adjacent wires. Our goal is to build a circuits that perform…
A crucial subroutine in quantum computing is to load the classical data of $N$ complex numbers into the amplitude of a superposed $n=\lceil \log_2N\rceil$-qubit state. It has been proven that any algorithm universally implementing this…
A variety of quantum algorithms employ Pauli operators as a convenient basis for studying the spectrum or evolution of Hamiltonians or measuring multi-body observables. One strategy to reduce circuit depth in such algorithms involves…
We present a formulation of the problem of finding the smallest T -Count circuit that implements a given unitary as a binary search over a sequence of continuous minimization problems, and demonstrate that these problems are numerically…
This paper proves strong lower bounds for distributed computing in the CONGEST model, by presenting the bit-gadget: a new technique for constructing graphs with small cuts. The contribution of bit-gadgets is twofold. First, developing…
Clifford circuits play an important role in quantum computation. Gottesman and Chuang proposed a gate teleportation protocol so that a quantum circuit can be implemented by the teleportation circuit with specific ancillary qubits. In…
Geometric phases are robust against certain types of local noises, and thus provide a promising way towards high-fidelity quantum gates. However, comparing with the dynamical ones, previous implementations of nonadiabatic geometric quantum…
We analyze the disordered Riemannian geometry resulting from random perturbations of the Euclidean metric. We focus on geodesics, the paths traced out by a particle traveling in this quenched random environment. By taking the point of the…
We show that the standard Heisenberg algebra of quantum mechanics admits a noncommutative differential calculus $\Omega^1$ depending on the Hamiltonian $p^2/2m + V(x)$, and a flat quantum connection $\nabla$ with torsion such that a…
This paper deals with finding surfaces in $\mathbb{R}^3$ which are as close as possible to being flat and span a given contour such that the contour is a geodesic on the sought surface. We look for a surface which minimizes the total…
Quantum computing promises a new approach to solving difficult computational problems, and the quest of building a quantum computer has started. While the first attempts on construction were succesful, scalability has never been achieved,…
In this paper, we prove that on every Finsler $n$-sphere $(S^n, F)$ with reversibility $\lambda$ satisfying $F^2<(\frac{\lambda+1}{\lambda})^2g_0$ and $l(S^n, F)\ge \pi(1+\frac{1}{\lambda})$, there always exist at least $n$ prime closed…