Related papers: Quasi-quantization of writhe in ideal knots
We present a general method for the implementation of quantum algorithms that optimizes both gate count and circuit depth. Our approach introduces connectivity-adapted CNOT-based building blocks called Parity Twine chains. It outperforms…
Fractional programming (FP) arises in various communications and signal processing problems because several key quantities in the field are fractionally structured, e.g., the Cram\'{e}r-Rao bound, the Fisher information, and the…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…
We consider the rate of convergence of the expected loss of empirically optimal vector quantizers. Earlier results show that the mean-squared expected distortion for any fixed distribution supported on a bounded set and satisfying some…
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given. This solution, an algorithm computing approximate zeros of complex polynomial systems in average polynomial time, assumed infinite…
We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, the $n^{O(d)}$-time degree $d$ Sum-of-Squares semidefinite programming relaxation for the clique problem will give…
Charge noise remains the primary obstacle to the development of quantum information technologies with semiconductor spin qubits. We use an exact analytical calculation to determine the effects of quasistatic charge noise on a ring of three…
We discuss relations among various positivities of knots and links, such as strong quasipositivity and quasipositivity. We give several pieces of supporting evidence for conjectural statements concerning these positivities and the defect of…
Quasi-twisted (QT) codes generalize several important families of linear codes, including cyclic, constacyclic, and quasi-cyclic codes. Despite their potential, to the best of our knowledge, there exists no efficient decoding algorithm for…
We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…
We report measurements of the compressibility of a one-dimensional (1D) quantum wire, defined in the upper well of a GaAs/AlGaAs double quantum well heterostructure. A wire defined simultaneously in the lower well probes the ability of the…
In this note we consider the problem of extracting the corrections to CFT data induced by the exchange of a primary operator and its descendents in the crossed channel. We show how those corrections which are analytic in spin can be…
Kondo tunneling reveals hidden SO(n) dynamical symmetries of evenly occupied quantum dots. As is exemplified for an experimentally realizable triple quantum dot in parallel geometry, the possible values n=3,4,5,7 can be easily tuned by gate…
A well-known conjecture in knot theory says that the percentage of hyperbolic knots amongst all of the prime knots of $n$ or fewer crossings approaches $100$ as $n$ approaches infinity. In this paper, it is proved that this conjecture…
Sine-skewed circular distributions are identifiable and have easily-computable trigonometric moments and a simple random number generation algorithm, whereas they are known to have relatively low levels of asymmetry. This study proposes a…
One-dimensional cut-and-project point sets obtained from the square lattice in the plane are considered from a unifying point of view and in the perspective of aperiodic wavelet constructions. We successively examine their geometrical…
We develop an optimized continuous-field quantum Monte Carlo (QMC) algorithm to investigate the SO(5) nonlinear sigma model with a Wess-Zumino-Witten term, which describes half-filled Dirac fermions in 2+1 space-time dimensions akin to…
A novel general approximation scheme (NGAS) proposed earlier (ref.2-3) is applied to the problem of the quartic anharmonic (QAHO) and the double-well-oscillator (QDWO) in quantum theory by choosing the infinite square-well-potential in one…
Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any…
A detailed discussion of semiclassical trace formulae is presented and it is demonstrated how a regularized trace formula can be derived while dealing only with finite and convergent expressions. Furthermore, several applications of trace…