Related papers: A geometric approach to quantum circuit lower boun…
This paper studies the space of $BV^2$ planar curves endowed with the $BV^2$ Finsler metric over its tangent space of displacement vector fields. Such a space is of interest for applications in image processing and computer vision because…
We explore quantum search from the geometric viewpoint of a complex projective space $CP$, a space of rays. First, we show that the optimal quantum search can be geometrically identified with the shortest path along the geodesic joining a…
The computational power of quantum phases of matter with symmetry can be accessed through local measurements, but what is the most efficient way of doing so? In this work, we show that minimizing operational resources in measurement-based…
The minimum cut problem in an undirected and weighted graph $G$ is to find the minimum total weight of a set of edges whose removal disconnects $G$. We completely characterize the quantum query and time complexity of the minimum cut problem…
Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the…
Consider the Lie group of n x n complex unitary matrices U(n) endowed with the bi-invariant Finsler metric given by the spectral norm, ||X||_U = ||U*X||_{sp} = ||X||_{sp} for any X tangent to a unitary operator U. Given two points in U(n),…
Nowadays, geometric tools are being used to treat a huge class of problems of quantum information science. By understanding the interplay between the geometry of the state space and information-theoretic quantities, it is possible to obtain…
In this paper, we investigate an approach to circuit lower bounds via bounded width circuits. The approach consists of two steps: (i) We convert circuits to (deterministic or nondeterministic) bounded width circuits. (ii) We prove lower…
We address the difference between integrable and chaotic motion in quantum theory as manifested by the complexity of the corresponding evolution operators. Complexity is understood here as the shortest geodesic distance between the…
The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph. In this work, we propose quantum algorithms for the diameter…
We establish a framework, namely, nuclear bounded Fr\'{e}chet manifolds endowed with Riemann-Finsler structures to study geodesic curves on certain infinite dimensional manifolds such as the manifold of Riemannian metrics on a closed…
Quantum computation represents an emerging framework to solve lattice gauge theories (LGT) with arbitrary gauge groups, a general and long-standing problem in computational physics. While quantum computers may encode LGT using only…
Classical methods of differential geometry are used to construct equations of motion for particles in quantum, electrodynamic and gravitational fields. For a five dimensional geometrical system, the equivalence principle can be extended.…
In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits…
In standard quantum mechanics, it is not possible to directly extend the Schrodinger equation to spinors, so the Pauli equation must be derived from the Dirac equation by taking its non-relativistic limit. Hence, it predicts the existence…
We prove new lower bounds on the growth of robust quantum circuit complexity -- the minimal number of gates $C_{\delta}(U)$ to approximate a unitary $U$ up to an error of $\delta$ in operator norm distance. More precisely we show two bounds…
In this paper, we propose a novel curvature-penalized minimal path model via an orientation-lifted Finsler metric and the Euler elastica curve. The original minimal path model computes the globally minimal geodesic by solving an Eikonal…
We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same…
Variational quantum algorithms use non-convex optimization methods to find the optimal parameters for a parametrized quantum circuit in order to solve a computational problem. The choice of the circuit ansatz, which consists of…
We consider $L^2$ minimizing geodesics along the group of volume preserving maps $SDiff(D)$ of a given 3-dimensional domain $D$. The corresponding curves describe the motion of an ideal incompressible fluid inside $D$ and are (formally)…