Related papers: Semiclassical Shor's Algorithm
We apply semidefinite programming for designing 1 to 2 symmetric qubit quantum cloners. These are optimized for the average fidelity of their joint output state with respect to a product of multiple originals. We design 1 to 2 quantum bit…
The execution cost of quantum algorithms is typically quantified through asymptotic gate counts and qubit register sizes, yet these metrics do not directly capture which genuinely quantum resources, and in what amount, must be created and…
Determining the prime factors of a given number N is a problem, which requires super-polynomial time for conventional digital computers. A polynomial-time algorithm was invented by P. Shor for quantum computers. However, the realization of…
We present a general derivation of semi-fermionic representation for generators of SU(N) group as a bilinear combination of Fermi operators. The constraints are fulfilled by means of imaginary Lagrange multipliers. The important case of…
We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…
Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…
If the states of spins in solids can be created, manipulated, and measured at the single-quantum level, an entirely new form of information processing, quantum computing, will be possible. We first give an overview of quantum information…
To see the feasibility of a large-scale quantum computing, it is required to accurately analyze the performance and the quantum resource. However, most of the analysis reported so far have focused on the statistical examination, i.e.,…
For a one-dimensional chain of four nuclear spins (1/2) and taking into account first and second neighbor interactions among the spin system, we make the numerical simulation of Shor prime factorization algorithm of the integer number N=4…
We present a DSSYK-like interpretation of the Schur half-indices of $\mathcal{N}=2$ $SU(2)$ gauge theories with matter, in the presence of fundamental Wilson lines. The Schur half-indices of these theories can be understood as transition…
We present reversible classical circuits for performing various arithmetic operations aided by dirty ancillae (i.e. extra qubits in an unknown state that must be restored before the circuit ends). We improve the number of clean qubits…
We study some extensions of Grover's quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching…
Several physics-based algorithms for factorizing large number were recently published. A notable recent one by Schleich et al. uses Gauss sums for distinguishing between factors and non-factors. We demonstrate two NMR techniques that…
We optimize fault-tolerant quantum error correction to reduce the number of syndrome bit measurements. Speeding up error correction will also speed up an encoded quantum computation, and should reduce its effective error rate. We give both…
We isolate and generalize a technique implicit in many quantum algorithms, including Shor's algorithms for factoring and discrete log. In particular, we show that the distribution sampled after a Fourier transform over ${\mathbb Z}_p$ can…
Machine learning techniques have led to broad adoption of a statistical model of computing. The statistical distributions natively available on quantum processors are a superset of those available classically. Harnessing this attribute has…
We study the quantum synchronization of a single spin driven by an external semiclassical signal for spin numbers larger than $S = 1$, the smallest system to host a quantum self-sustained oscillator. The occurrence of interference-based…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…
We present a special-purpose algorithm for factoring semiprimes $N = pq$ in which one prime factor satisfies $p \approx c\,(a/b)^n$ for positive integers $a, b, c, n$ with $a > b$ and $\gcd(a,b) = 1$. Given the correct parameters $(a, b)$,…
We introduce new coherent states and use them to prove semi-classical estimates for Schr\"odinger operators with regular potentials. This can be further applied to the Thomas-Fermi potential yielding a new proof of the Scott correction for…