Related papers: Norm Inequality for Perturbed Quantum Evolutions a…
The task of testing whether two uncharacterized quantum devices behave in the same way is crucial for benchmarking near-term quantum computers and quantum simulators, but has so far remained open for continuous-variable quantum systems. In…
Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size $N$ using $O(\sqrt{N})$ queries. It provides a significant speed-up over any classical algorithm \cite{Gro96}. The running time of the…
Various models of quantum gravity suggest a modification of the Heisenberg's Uncertainty Principle, to the so-called Generalized Uncertainty Principle, between position and momentum. In this work we show how this modification influences the…
In this manuscript we address the problem of deriving \emph{analytic} expressions for calculating universal decoherence-induced errors in qubits undergoing arbitrary, unitary, time-dependent quantum-control protocols. For a qubit undergoing…
The theory of decoherent histories is an attempt to derive classical physics from positing only quantum laws at the fundamental level without notions of a classical apparatus or collapse of the wave-function. Searching for a marked target…
Quantum coherence profoundly alters classical thermodynamic expectations by modifying the structure and accessibility of probability distributions. Classically, transitions to lower-entropy states (local second-law violations) are…
We study the quantum evolution under the combined action of the exponentials of two not necessarily commuting operators. We consider the limit in which the two evolutions alternate at infinite frequency. This case appears in a plethora of…
We show that only those composite quantum systems possessing nonvanishing quantum correlations have the property that any nontrivial local unitary evolution changes their global state. We derive the exact relation between the global state…
Grover's quantum search algorithm drives a quantum computer from a prepared initial state to a desired final state by using selective transformations of these states. Here, we analyze a framework when one of the selective trasformations is…
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…
It is suggested that the individual outcomes of a measurement process can be understood within standard quantum mechanics in terms of the measuring apparatus, treated as a quantum computer, executing Grover's search algorithm.
Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in…
We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. In particular, we focus on superconducting platforms and consider a network of qubits -- encoded in the states of artificial atoms…
We present the coherent states of the harmonic oscillator in the framework of the generalized (gravitational) uncertainty principle (GUP). This form of GUP is consistent with various theories of quantum gravity such as string theory, loop…
Grover's algorithm solves the unstructured search problem. Grover's algorithm can find the target state with certainty only if searching one out of four. Designing the deterministic search algorithm can avoid any repetition of the…
It is recognized that Grover arrived at his original quantum search algorithm inspired by his comprehension of the interference of classical waves originating from an array of antennas. It is also known that quantum-mechanical…
We theoretically study the effect of long-ranged inhomogeneities on the critical properties of the integer quantum Hall transition. For this purpose we employ the real-space renormalization-group (RG) approach to the network model of the…
We propose a new approach to study the evolution of a quantum state that is encoded in a system which is continuously subject to the operations required to implement a quantum error correcting code. In the limit of continuous error…
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…
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by $\pi/2$ phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked…