Related papers: A geometric approach to quantum circuit lower boun…
The surface code is a promising candidate for fault-tolerant quantum computation and has been implemented in many quantum hardware platforms. In this work, we propose a new non-local unitary circuit to encode a surface code state based on a…
Algorithms for minimal enclosing ball problems are often geometric in nature. To highlight the metric ingredients underlying their efficiency, we focus here on a particularly simple geodesic-based method. A recent subgradient-based study…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
The current noisy intermediate-scale quantum (NISQ) era is characterized by substantial errors and noise, which limit the practical feasibility of deep, many-qubit circuits. To address these constraints, quantum circuit cutting has emerged…
We establish sharp universal upper bounds on the length of the shortest closed geodesic on a punctured sphere with three or four ends endowed with a complete Riemannian metric of finite area. These sharp curvature-free upper bounds are…
In this short note we discuss upper bounds for the critical values of homology classes in the based and free loop space of manifolds carrying a Riemannian or Finsler metric of positive Ricci curvature. In particular it follows that a…
It has been known for almost 30 years that quantum circuits with interspersed depolarizing noise converge to the uniform distribution at $\omega(\log n)$ depth, where $n$ is the number of qubits, making them classically simulable. We show…
Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily…
We give a universal upper bound for the total curvature of minimizing geodesic on a convex surface in the Euclidean space.
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…
Riemannian geometry provides us with powerful tools to explore the latent space of generative models while preserving the underlying structure of the data. The latent space can be equipped it with a Riemannian metric, pulled back from the…
C. A. Fuchs and M. Sasaki defined the quantumness of a set of quantum states in \cite{Quantumness}, which is closely related to the fidelity loss in transmission of the quantum states through a classical channel. In \cite{Fuchs}, Fuchs…
In the standard circuit model, elementary gates are defined relative to a chosen tensor factorization and are therefore extrinsic to the ambient group $U(2^n)$. Writing $N=2^n$, we introduce an \emph{intrinsic descriptor layer} in $U(N)$ by…
We determine the length of the shortest nontrivial geodesic loops on the Stiefel manifold endowed with any member of the one-parameter family of Riemannian metrics introduced by H\"uper et al. (2021). This family includes, in particular,…
We study the fuzzy spaces (as special examples of noncommutative manifolds) with their quasicoherent states in order to find their pertinent metrics. We show that they are naturally endowed with two natural "quantum metrics" which are…
We propose a method to obtain optimal protocols for adiabatic ground-state preparation near the adiabatic limit, extending earlier ideas from [D. A. Sivak and G. E. Crooks, Phys. Rev. Lett. 108, 190602 (2012)] to quantum non-dissipative…
Every Euclidean domain $R$ has a minimal Euclidean function, $\phi_R$. A companion paper \cite{Graves} introduced a formula to compute $\phi_{\mathbb{Z}[i]}$. It is the first formula for a minimal Euclidean function for the ring of integers…
The purpose of this article is to exploit the geometric structure of Quantum Mechanics and of statistical manifolds to study the qualitative effect that the quantum properties have in the statistical description of a system. We show that…
We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing…
We prove that any $n$-qubit unitary can be implemented (i) approximately in time $\tilde O\big(2^{n/2}\big)$ with query access to an appropriate classical oracle, and also (ii) exactly by a circuit of depth $\tilde O\big(2^{n/2}\big)$ with…