相关论文: A geometric approach to quantum circuit lower boun…
The group of local unitary transformations partitions the space of n-qubit quantum states into orbits, each of which is a differentiable manifold of some dimension. We prove that all orbits of the n-qubit quantum state space have dimension…
Based on a novel type of Sobolev-Poincar\'e inequality (for generalised weakly differentiable functions on varifolds), we establish a finite upper bound of the geodesic diameter of generalised compact connected surfaces-with-boundary of…
We have developed methods for performing qudit quantum computation in the Jaynes-Cummings model with the qudits residing in a finite subspace of individual harmonic oscillator modes, resonantly coupled to a spin-1/2 system. The first method…
Describing a particle in an external electromagnetic field is a basic task of quantum mechanics. The standard scheme for this is known as "minimal coupling", and consists of replacing the momentum operators in the Hamiltonian by modified…
We investigate the behavior of non-Euclidean plates with constant negative Gaussian curvature using the F\"oppl-von K\'arm\'an reduced theory of elasticity. Motivated by recent experimental results, we focus on annuli with a periodic…
Quantum optimization as a field has largely been restricted by the constraints of current quantum computing hardware, as limitations on size, performance, and fidelity mean most non-trivial problem instances won't fit on quantum devices.…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
We investigate the motion of test particles in quantum-gravitational backgrounds by introducing the concept of q--desics, quantum-corrected analogs of classical geodesics. Unlike standard approaches that rely solely on the expectation value…
One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…
A quantum clock cannot be modeled as a point mass moving along a single geodesic if it is in a state with nonzero position fluctuations. Instead, it is an extended object subject to tidal forces and a superposition of time dilations at…
A CNOT circuit is the key gadget for entangling qubits in quantum computing systems. However, the qubit connectivity of noisy intermediate-scale quantum (NISQ) devices is constrained by their {limited connectivity architecture}. To improve…
We prove several new lower bounds for constant depth quantum circuits. The main result is that parity (and hence fanout) requires log depth circuits, when the circuits are composed of single qubit and arbitrary size Toffoli gates, and when…
We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) model $\cal M$ is given and the goal is to…
High-fidelity entangling gates are essential for quantum computation. Currently, most approaches to designing such gates are based either on simple, analytical pulse waveforms or on ones obtained from numerical optimization techniques. In…
Protocols for quantum measurement are an essential part of quantum computing. Measurements are no longer confined to the final step of computation but are increasingly embedded within quantum circuits as integral components of…
Let M be a finite von Neumann algebra with a faithful trace $\tau$. In this paper we study metric geometry of homogeneous spaces O of the unitary group U of M, endowed with a Finsler quotient metric induced by the p-norms of $\tau$,…
Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and…
Small numbers of qubits are one of the primary constraints on the near-term deployment of advantageous quantum computing. To mitigate this constraint, techniques have been developed to break up a large quantum computation into smaller…
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…
We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate…