Related papers: Quantum Chaos and Quantum Algorithms
Grover's algorithm constitutes the optimal quantum solution to the search problem and provides a quadratic speed-up over all possible classical search algorithms. Quantum interference between computational paths has been posited as a key…
An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions…
We extract the information of a quantum motion and decode it into a certain orbit via a single measurable quantity. Such that a quantum chaotic system can be reconstructed as a chaotic attractor. Two configurations for reconstructing this…
Chaos transition, as an important topic, has become an active research subject in non-linear science. By considering a Dicke Hamiltonian coupled to a bath of harmonic oscillator, we have been able to introduce a logistic map with quantum…
We discuss how the concept of the quantum action can be used to characterize quantum chaos. As an example we study quantum mechanics of the inverse square potential in order to test some questions related to quantum action. Quantum chaos is…
Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical…
In this work we study several models of decoherence and how different quantum maps and algorithms react when perturbed by them. Following closely Ref. [1], generalizations of the three paradigmatic one single qubit quantum channels (these…
In order to understand the bounds of utilization of the Grover's search algorithm for the large unstructured data in presence of the quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modelled…
We study the dynamics of a "kicked" quantum system undergoing repeated measurements of momentum. A diffusive behavior is obtained for a large class of Hamiltonians, even when the dynamics of the classical counterpart is not chaotic. These…
Quantum computing is changing the way we think about computing. Significant strides in research and development for managing and harnessing the power of quantum systems has been made in recent years, demonstrating the potential for…
The quantum computer algorithm by Peter Shor for factorization of integers is studied. The quantum nature of a QC makes its outcome random. The output probability distribution is investigated and the chances of a successful operation is…
Quantum computers are hypothetical devices, based on quantum physics, that would enable us to perform certain computations hundreds of orders of magnitude faster than digital computers. This feature is coined as "quantum supremacy" and one…
The dynamical status of isolated quantum systems, partly due to the linearity of the Schrodinger equation is unclear: Conventional measures fail to detect chaos in such systems. However, when quantum systems are subjected to observation --…
Quantum computers facing chaos. Quantum parallelism allows to perform computation in a radically new manner. A quantum computer based on these new principles may resolve certain problems exponentially faster than a classical computer. We…
Recent studies have shown that there is a strong interplay between quantum complexity and quantum chaos. In this work, we consider a new method to study geometric complexity for interacting non-Gaussian quantum mechanical systems to…
By harnessing the superposition and entanglement of physical states, quantum computers could outperform their classical counterparts in solving problems of technological impact, such as factoring large numbers and searching databases. A…
The classical and quantum dynamics of two ultra-strongly coupled and weakly nonlinear resonators cannot be explained using the Discrete Nonlinear Schr\"odinger Equation or the Bose-Hubbard model, respectively. Instead, a model beyond the…
Quantum computers hold the promise to solve certain computational task much more efficiently than classical computers. We review the recent experimental advancements towards a quantum computer with trapped ions. In particular, various…
We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the "frame potential," which is minimized by unitary $k$-designs and measures the $2$-norm…
We study the interplay between ordered and chaotic dynamics at the critical point of a generic first-order quantum phase transition in the interacting boson model of nuclei. Classical and quantum analyses reveal a distinct behavior of the…