Related papers: Performance of Uncoded Implementation of Grover's …
This paper discusses an improvement to Grover's algorithm for searches where target states are Hamming weight eigenstates and search space is not ordered. It is shown that under these conditions search efficiency depends on the smaller…
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…
Quantum computing is rapidly advancing toward cloud-based services, raising significant concerns about the privacy and security of computations outsourced to untrusted quantum servers. Universal Blind Quantum Computation (UBQC) protocols…
Given two sets A and B and two oracles O(A) and O(B) that can identify the elements of these sets respectively, the goal is to find an element common to both sets using minimum number of oracle queries. Each application of either O(A) or…
Quantum circuit simulations are critical for evaluating quantum algorithms and machines. However, the number of state amplitudes required for full simulation increases exponentially with the number of qubits. In this study, we leverage data…
The recursion equation analysis of Grover's quantum search algorithm presented by Biham et al. [PRA 60, 2742 (1999)] is generalized. It is applied to the large class of Grover's type algorithms in which the Hadamard transform is replaced by…
Recent advances in quantum computing systems attract tremendous attention. Commercial companies, such as IBM, Amazon, and IonQ, have started to provide access to noisy intermediate-scale quantum computers. Researchers and entrepreneurs…
We investigate the fidelity of Grover's search algorithm by implementing it on an open quantum system. In particular, we study with what accuracy one can estimate that the algorithm would deliver the searched state. In reality, every system…
Decoherence of quantum states is a major hurdle towards scalable and reliable quantum computing. Lower decoherence (i.e., higher fidelity) can alleviate the error correction overhead and obviate the need for energy-intensive noise reduction…
Coherence plays a very important role in Grover search algorithm (GSA). In this paper, we define the normalization coherence N(C), where C is a coherence measurement. In virtue of the constraint of large N and Shannon's maximum entropy…
Grover's quantum search algorithm provides a quadratic quantum advantage over classical algorithms across a broad class of unstructured search problems. The original protocol is probabilistic, returning the desired result with significant…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
Spin qubits in silicon are strong contenders for realizing a practical quantum computer. This technology has made remarkable progress with the demonstration of single and two-qubit gates above the fault-tolerant threshold and entanglement…
Classical simulation of noisy quantum circuits is essential for understanding quantum computing experiments. It enables scalable error characterization, analysis of how noise impacts quantum algorithms, and optimized implementations of…
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design.…
Quantum contextuality is a limitation on deterministic hidden variable models, testable in measurement scenarios where outcomes differ under quantum or classical descriptions due to a common set of constraints. When considering measurements…
We present a systematic construction of quantum circuits implementing Grover's database search algorithm for arbitrary number of targets. We introduce a new operator which flips the sign of the targets and evaluate its circuit complexity.…
Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several…
With qubit measurement and control fidelities above the threshold of fault-tolerance, much attention is moving towards the daunting task of scaling up the number of physical qubits to the large numbers needed for fault tolerant quantum…
We show a possible way to implement the Grover algorithm in large nuclear spins 1/2<I<9/2 in semiconductors. The Grover sequence is performed by means of multiphoton transitions that distribute the spin amplitude between the nuclear spin…