Related papers: Shuffling cards, factoring numbers, and the quantu…
We formulate and numerically simulate the single control qubit Shor algorithm for the case of static imperfections induced by residual couplings between qubits. This allows us to study the accuracy of Shor's algorithm with respect to these…
Using quantum maps we study the accuracy of semiclassical trace formulas. The role of chaos in improving the semiclassical accuracy, in some systems, is demonstrated quantitatively. However, our study of the standard map cautions that this…
We present a measure of quantum coherence by employing the concept of noncommutativity of operators in quantum mechanics. We analyse the behaviour of this noncommutative coherence and underline its similarities and differences with the…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
We develop Yang-Baxter integrability structures connected with the quantum affine superalgebra Uq(\hat sl(2|1)). Baxter's Q-operators are explicitly constructed as supertraces of certain monodromy matrices associated with (q-deformed)…
A proof is given that an invertible and a unitary operator can be used to reproduce the effect of a q-deformed commutator of annihilation and creation operators. In other words, the original annihilation and creation operators are mapped…
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…
The transfer operator due to Bogomolny provides a convenient method for obtaining a semiclassical approximation to the energy eigenvalues of a quantum system, no matter what the nature of the analogous classical system. In this paper, the…
How can we generate a permutation of the numbers $1$ through $n$ so that it is hard to guess the next element given the history so far? The twist is that the generator of the permutation (the ``Dealer") has limited memory, while the…
We study relevant features of the spectrum of the quantum open baker map. The opening consists of a cut along the momentum $p$ direction of the 2-torus phase space, modelling an open chaotic cavity. We study briefly the classical forward…
A major obstacle to implementing Shor's quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of…
The first application of a quantum algorithm to Feynman loop integrals is reviewed. The connection between quantum computing and perturbative quantum field theory is feasible due to fact that the two on-shell states of a Feynman propagator…
Implementing general functions of operators is a powerful tool in quantum computation. It can be used as the basis for a variety of quantum algorithms including matrix inversion, real and imaginary-time evolution, and matrix powers. Quantum…
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…
In this note we describe a simple and intriguing observation: the quantum Fourier transform (QFT) over $Z_q$, which is considered the most ``quantum'' part of Shor's algorithm, can in fact be simulated efficiently by classical computers.…
Theory of computer calculations strongly depends on the nature of elements the computer is made of. Quantum interference allows to formulate the Shor factorization algorithm turned out to be more effective than any one written for classical…
We construct six multi-parameter families of Hermitian quasi-exactly solvable matrix Schroedinger operators in one variable. The method for finding these operators relies heavily upon a special representation of the Lie algebra o(2,2) whose…
This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode…
Quantum computing has the potential to significantly speed up complex computational tasks, and arguably the most promising application area for near-term quantum computers is the simulation of quantum mechanics. To make the most of our…
Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian…