Related papers: Chaotic Roots of the Modular Multiplication Dynami…
We study measurement-induced nonlinear dynamics generated by an iterated quantum protocol combining an entangling gate, a single-qubit rotation, and post-selection. For pure single-qubit inputs, a particular choice of the single-qubit…
In a recent work of Wu, Wang, Sun and Liu, a second-order explicit symplectic integrator was proposed for the integrable Kerr spacetime geometry. It is still suited for simulating the nonintegrable dynamics of charged particles moving…
The quantum baker's map is the quantization of a simple classically chaotic system, and has many generic features that have been studied over the last few years. While there exists a semiclassical theory of this map, a more rigorous study…
We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of "factoring"…
The notion of Bohr chaos was introduced in [3, 4]. We answer a question raised in [3] of whether a non uniquely ergodic minimal system of positive topological entropy can be Bohr chaotic. We also prove that all systems with the…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
Random constraint satisfaction problems can display a very rich structure in the space of solutions, with often an ergodicity breaking -- also known as clustering or dynamical -- transition preceding the satisfiability threshold when the…
Shor's algorithm, which given appropriate hardware can factorise an integer $N$ in a time polynomial in its binary length $L$, has arguable spurred the race to build a practical quantum computer. Several different quantum circuits…
While classical chaos has been successfully characterized with consistent theories and intuitive techniques, such as with the use of Lyapunov exponents, quantum chaos is still poorly understood, as well as its relation with multi-partite…
We show how the execution time of algorithms on quantum computers depends on the architecture of the quantum computer, the choice of algorithms (including subroutines such as arithmetic), and the ``clock speed'' of the quantum computer. The…
The interaction of an atom with an electromagnetic field is discussed in the presence of a time periodic external modulating force. It is explained that a control on atom by electromagnetic fields helps to design the quantum analog of…
We study the classical non-linear dynamics of the $SU(2)$ Yang-Mills matrix model introduced in [1] as a low-energy approximation to two-color QCD. Restricting to the spin-0 sector of the model, we unearth an unexpected tetrahedral…
Typical circuit implementations of Shor's algorithm involve controlled rotation gates of magnitude $\pi/2^{2L}$ where $L$ is the binary length of the integer N to be factored. Such gates cannot be implemented exactly using existing…
Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring…
An elementary application of Algorithmic Complexity Theory to the polygonal approximations of curved billiards-integrable and chaotic-unveils the equivalence of this problem to the procedure of quantization of classical systems: the scaling…
Quantum algorithms face significant challenges due to qubit susceptibility to environmental noise, and quantum error correction typically requires prohibitive resource overhead. This paper proposes that quantum algorithms may possess…
We report the numerical observation of scarring, that is enhancement of probability density around unstable periodic orbits of a chaotic system, in the eigenfunctions of the classical Perron-Frobenius operator of noisy Anosov ("cat") maps,…
In the framework of semiclassical theory the universal properties of quantum systems with classically chaotic dynamics can be accounted for through correlations between partner periodic orbits with small action differences. So far, however,…
Coded matrix multiplication is a technique to enable straggler-resistant multiplication of large matrices in distributed computing systems. In this paper, we first present a conceptual framework to represent the division of work amongst…
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.,…