Related papers: A geometric approach to quantum circuit lower boun…
We revisit the construction of quantum Riemannian geometries on graphs starting from a hermitian metric compatible connection, which always exists. We use this method to find quantum Levi-Civita connections on the $n$-leg star graph for…
We present a theory of quantum stabilizer turbo-encoders with unbounded minimum distance. This theory is presented under a framework common to both classical and quantum turbo-encoding theory. The main conditions to have an unbounded…
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivity, and coherence times, a quantum circuit optimization is essential to make the best use of near-term quantum devices. We…
As a fundamental concept in condensed matter physics, quantum geometry within the Riemannian metric elucidates various exotic phenomena, including the Hall effects driven by Berry curvature and quantum metric. In this work, we propose novel…
Given an undirected, weighted graph, with $n$ vertices and $m$ edges, and two special vertices $s$ and $t$, the problem is to find the shortest path between them. We give two bounded-error quantum algorithms with improved runtime in the…
In this paper we study 1/k geodesics, those closed geodesics that minimize on all subintervals of length $L/k$, where $L$ is the length of the geodesic. We develop new techniques to study the minimizing properties of these curves on doubled…
Non-transitive subgroups of the orthogonal group play an important role in the non-Euclidean geometry. If $G$ is a closed subgroup in the orthogonal group such that the orbit of a single Euclidean unit vector does not cover the (Euclidean)…
A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a a unitary matrix U, into a product of simpler U j via a neural network. These U j can then be decomposed…
We present a family of quantum stabilizer codes using the structure of duadic constacyclic codes over $\mathbb{F}_4$. Within this family, quantum codes can possess varying dimensions, and their minimum distances are lower bounded by a…
We present an information geometric analysis of entropic speeds and entropy production rates in geodesic evolution on manifolds of parametrized quantum states. These pure states emerge as outputs of suitable su(2; C) time-dependent…
Understanding and mitigating noise in quantum systems is a fundamental challenge in achieving scalable and fault-tolerant quantum computation. Error modeling for quantum systems can be formulated in many ways, some of which are very…
We present a new Python package that uses the established notion of geometric quantum complexity to numerically compute the difficulty associated with preparing a given unitary transformation on a quantum computer. The numerical procedure…
A piecewise flat Finsler metric on a triangulated surface $M$ is a metric whose restriction to any triangle is a flat triangle in some Minkowski space with straight edges. One of the main purposes of this work is to study the properties of…
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into a set of computations that…
We devise greedy heuristics tailored for synthesizing quantum circuits that implement a specified set of Pauli rotations. Our heuristics are designed to minimize either the count of entangling gates or the depth of entangling gates, and…
We study circuit complexity for a free vector field of a $U(1)$ gauge theory in Coulomb gauge, and Gaussian states. We introduce a quantum circuit model with Gaussian states, including reference and target states. Using the Nielsen's…
A notorious open question in circuit complexity is whether Boolean operations of arbitrary arity can efficiently be expressed using modular counting gates only. H{\aa}stad's celebrated switching lemma yields exponential lower bounds for the…
Existing quantum systems provide very limited physical qubit counts, trying to execute a quantum algorithm/circuit on them that have a higher number of logical qubits than physically available lead to a compile-time error. Given that it is…
The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation stating that arbitrarily long quantum computations can be performed with a polylogarithmic overhead provided the noise level is below a…
Nielsen's geometric approach offers a powerful framework for quantifying the complexity of unitary transformations. In this formulation, complexity is defined as the length of the minimal geodesic in a suitably constructed geometric space…