Related papers: Amplitude Amplification and Estimation using a Flo…
Quantum squeezed states, with reduced quantum noise, have been widely utilized in quantum sensing and quantum error correction applications. However, generating and manipulating these nonclassical states with a large squeezing degree…
Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal…
We consider a finite-size periodically driven quantum system of coupled kicked rotors which exhibits two distinct regimes in parameter space: a dynamically-localized one with kinetic-energy saturation in time and a chaotic one with…
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…
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…
The Grover search algorithm performs an unstructured search of a marked item in a database quadratically faster than classical algorithms and is shown to be optimal. Here, we show that if the search space is divided into two blocks with the…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…
The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…
Although entanglement is widely considered to be necessary for quantum algorithms to improve on classical ones, Lloyd has observed recently that Grover's quantum search algorithm can be implemented without entanglement, by replacing…
We investigate strategies for reaching the ultimate limit on the precision of frequency estimation when the number of probes used in each run of the experiment is fixed. That limit is set by the quantum Cram\'er-Rao bound (QCRB), which…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
Krylov complexity (K-complexity) is a measure of quantum state complexity that minimizes wavefunction spreading across all the possible bases. It serves as a key indicator of operator growth and quantum chaos. In this work, K-complexity and…
We investigate the possibility of an Anderson type transition in the quantum kicked rotor with a smooth potential due to dynamical localization of the wavefunctions. Our results show the typical characteristics of a critical behavior i.e…
Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, because of the noise in quantum channels, it is difficult to distribute quantum entanglement over a long distance in…
Anderson localization is the ubiquitous phenomenon of inhibition of transport of classical and quantum waves in a disordered medium. In dimension one, it is well known that all states are localized, implying that the distribution of an…
A quantum computer encodes information in quantum states and runs quantum algorithms to surpass the classical counterparts by exploiting quantum superposition and quantum correlation. Grover's quantum search algorithm is a typical quantum…
Quantum algorithm design plays a crucial role in exploiting the computational advantage of quantum devices. Here we develop a deep-reinforcement-learning based approach for quantum adiabatic algorithm design. Our approach is generically…
Despite the periodic kicks, a linear kicked rotor (LKR) is an integrable and exactly solvable model in which the kinetic energy term is linear in momentum. It was recently shown that spatially interacting LKRs are also integrable, and…
We analyze the dynamics of a quantum kicked rotor (QKR) driven with a binary Fibonacci sequence of two distinct drive amplitudes. While the dynamics at low drive frequencies is found to be diffusive, a long-lived pre-ergodic regime emerges…
Quantum computing (QC) emulators, which simulate quantum algorithms on classical hardware, are indispensable platforms for testing quantum algorithms before scalable quantum computers become widely available. A critical challenge in QC…