Related papers: Chaotic Roots of the Modular Multiplication Dynami…
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 semiclassical methods, it is possible to construct very accurate approximations in the short wavelength limit of quantum dynamics that rely exclusively on classical dynamical input. For systems whose classical realization is strongly…
A short historical overview is given on the development of our knowledge of complex dynamical systems with special emphasis on ergodicity and chaos, and on the semiclassical quantization of integrable and chaotic systems. The general trace…
How chaos is useful in the brain information processing is greatly unknown. Here, we show that the statistical property of chaos such as invariant measures naturally organized under a great number of iterations of chaotic mappings can be…
There exists a Hamiltonian formulation of the factorisation problem which also needs the definition of a factorisation ensemble (a set to which factorable numbers, $N'=x'y'$, having the same trivial factorisation algorithmic complexity,…
We discuss the role of ergodicity and chaos for the validity of statistical laws. In particular we explore the basic aspects of chaotic systems (with emphasis on the finite-resolution) on systems composed of a huge number of particles.
Shor's algorithm is one of the most promising applications of quantum computers. However, since $\sim 10^6$ physical qubits are believed to be required for established approaches, the algorithm will need to be distributed across many…
We study the time evolution operator in a family of local quantum circuits with random fields in a fixed direction. We argue that the presence of quantum chaos implies that at large times the time evolution operator becomes effectively a…
A Kerr-nonlinear parametric oscillator (KPO) can generate a quantum superposition of two oscillating states, known as a Schr\"{o}dinger cat state, via quantum adiabatic evolution, and can be used as a qubit for gate-based quantum computing…
We study the statistical and dynamical properties of the quantum triangle map, whose classical counterpart can exhibit ergodic and mixing dynamics, but is never chaotic. Numerical results show that ergodicity is a sufficient condition for…
An efficient quantum modular exponentiation method is indispensible for Shor's factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al., are flawed. We also remark that some…
We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n+3 qubits and O(n^3 lg(n)) elementary quantum gates in a depth of O(n^3) to…
Shor's factoring algorithm is one of the most anticipated applications of quantum computing. However, the limited capabilities of today's quantum computers only permit a study of Shor's algorithm for very small numbers. Here we show how…
We consider the spectral form factor of random unitary matrices as well as of Floquet matrices of kicked tops. For a typical matrix the time dependence of the form factor looks erratic; only after a local time average over a suitably large…
The Birkhoff Ergodic Theorem asserts under mild conditions that Birkhoff averages (i.e. time averages computed along a trajectory) converge to the space average. For sufficiently smooth systems, our small modification of numerical Birkhoff…
Most classical dynamical systems are chaotic. The trajectories of two identical systems prepared in infinitesimally different initial conditions diverge exponentially with time. Quantum systems, instead, exhibit quasi-periodicity due to…
Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their…
The standard generic quantum computer model is studied analytically and numerically and the border for emergence of quantum chaos, induced by imperfections and residual inter-qubit couplings, is determined. This phenomenon appears in an…
A system of quantum computing structures is introduced and proven capable of making emerge, on average, the orbits of classical bounded nonlinear maps on \mathbb{C} through the iterative action of path-dependent quantum gates. The effects…
The preparation of the stationary distribution of irreducible, time-reversible Markov chains is a fundamental building block in many heuristic approaches to algorithmically hard problems. It has been conjectured that quantum analogs of…