Related papers: Optimal fidelity in implementing Grover's search a…
This work studies the feasibility of optimal control of high-fidelity quantum gates in a model of interacting two-level particles. One particle (the qubit) serves as the quantum information processor, whose evolution is controlled by a…
We investigate a long time asymptotic state of periodically driven open quantum systems analytically. The model we consider in this paper is a free fermionic system coupled to an energy and particle reservoir. We clarify some generic…
Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms. Unlike classical systems, however, identical quantum circuits may exhibit substantially different behavior across devices…
Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful applications. To gauge the practical…
Using Grover algorithm, this work investigates a technique for encoding search phrases used in wildcard searches. The technique involves creating a phase Oracle that loads data into a quantum circuit together with the search terms that have…
The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism…
We study the fully generalized Grover's algorithm to find the optimal phase changes for each step of the iteration to maximize gain in probability of observation of the target, and when phase matching is required. We find that classical…
In this paper we analyze the dynamics in a spin-model of quantum computer. Main attention is paid to the dynamical fidelity (associated with dynamical errors) of an algorithm that allows to create an entangled state for remote qubits. We…
We present an approach for efficiently simulating strongly damped quantum systems subjected to periodic driving, employing a periodic matrix product operator representation of the influence functional. This representation enables the…
When a distributed algorithm must be executed by strategic agents with misaligned interests, a social leader needs to introduce an appropriate tax/subsidy mechanism to incentivize agents to faithfully implement the intended algorithm so…
Thermodynamics entails a set of mathematical conditions on quantum Markovian dynamics. In particular, strict energy conservation between the system and environment implies that the dissipative dynamical map commutes with the unitary system…
We analyze the performance of holonomic quantum gates in semi-conductor quantum dots, driven by ultrafast lasers, under the effect of a dissipative environment. In agreement with the standard practice, the environment is modeled as a…
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the system, the environment and their interaction:…
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…
Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit…
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for entanglement measure defined in terms of success rate of Grover's search algorithm has…
We analyze three different quantum search algorithms, the traditional Grover's algorithm, its continuous-time analogue by Hamiltonian evolution, and finally the quantum search by local adiabatic evolution. We show that they are closely…
Approximate algorithms for structured prediction problems---such as LP relaxations and the popular alpha-expansion algorithm (Boykov et al. 2001)---typically far exceed their theoretical performance guarantees on real-world instances. These…
This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…