Related papers: Quantum Chaos and Quantum Algorithms
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…
We consider stability of a general quantum algorithm with respect to a fixed but unknown residual interaction between qubits, and show a surprising fact, namely that the average fidelity of quantum computation increases by decreasing…
We examine whether the chaotic behavior of classical systems with a limited number of degrees of freedom can produce quantum dephasing, against the conventional idea that dephasing takes place only in large systems with a huge number of…
We investigate a quantum algorithm which simulates efficiently the quantum kicked rotator model, a system which displays rich physical properties, and enables to study problems of quantum chaos, atomic physics and localization of electrons…
We study a generic model of quantum computer, composed of many qubits coupled by short-range interaction. Above a critical interqubit coupling strength, quantum chaos sets in, leading to quantum ergodicity of the computer eigenstates. In…
We provide compelling evidence for the presence of quantum chaos in the unitary part of Shor's factoring algorithm. In particular we analyze the spectrum of this part after proper desymmetrization and show that the fluctuations of the…
We investigate a 2-spin quantum Turing architecture, in which discrete local rotations \alpha_m of the Turing head spin alternate with quantum controlled NOT-operations. We demonstrate that a single chaotic parameter input \alpha_m leads to…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
We study a one-dimensional chain of nuclear $1/2-$spins in an external time-dependent magnetic field. This model is considered as a possible candidate for experimental realization of quantum computation. According to the general theory of…
We show that the quantum baker's map, a prototypical map invented for theoretical studies of quantum chaos, has a very simple realization in terms of quantum gates. Chaos in the quantum baker's map could be investigated experimentally on a…
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…
Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum…
Quantum groups have a long and fruitful history of applications in integrable systems. Can quantum group symmetries exist in the absence of integrability? We provide an explicit example of a system with quantum group global symmetry which…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…
Understanding the emergence of quantum chaos in multipartite systems is challenging in the presence of interactions. We show that the contribution of the subsystems to the global behavior can be revealed by probing the full counting…
In general, a quantum algorithm wants to avoid decoherence or perturbation, since such factors may cause errors in the algorithm. In this letter, we will supply the answer to the interesting question: can the factors seemingly harmful to a…
Basic concepts of quantum theory of information, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are briefly reviewed.…
We have found stable chaotic solutions for optomechanical systems coupled with a Two-Level System or qubit. In this system methods have been found which can be used to Tune in and out of Chaos as well as various n-period motions. This…