Related papers: A Quantitative Measure of Interference
The minimal Bures distance of a quantum state of a bipartite system AB to the set of classical states for subsystem A defines a geometric measure of quantum discord. When A is a qubit, we show that this geometric quantum discord is given in…
The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks. We introduce a new approach in…
We demonstrate new experimental procedures for measuring small errors in a superconducting quantum bit (qubit). By carefully separating out gate and measurement errors, we construct a complete error budget and demonstrate single qubit gate…
Grover's algorithm is a cornerstone of quantum search algorithm, offering quadratic speedup for unstructured problems. However, limited qubit counts and noise in today's noisy intermediate-scale quantum (NISQ) devices hinder large-scale…
It is first pointed out that there is a common mathematical model for the universe and the quantum computer. The former is called the histories approach to quantum mechanics and the latter is called measurement based quantum computation.…
In this article, we propose a distributed quantum algorithm for solving counting problem using Grover operator and a classical post-processing procedure. We apply the proposed algorithm to estimate inner products and Hamming distances.…
Quantum theory implies, and empirical evidence confirms, that while particles $\textit{can}$ exhibit wave-like behavior in interferometric experiments, this behavior is so limited as $\textit{not}$ to allow for third- and higher-order…
Different criteria (Shannon's entropy, Bayes' average cost, Durr's normalized rms spread) have been introduced to measure the "which-way" information present in interference experiments where, due to non-orthogonality of the detector…
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…
We propose to use quantum interferences to improve the accuracy of the measurement of the free fall acceleration g of antihydrogen in the GBAR experiment. This method uses most antiatoms prepared in the experiment and it is simple in its…
Shor's factoring algorithm is one of the most anticipated applications of quantum computing. However, the limited capabilities of today's quantum computers only permit a study of Shor's algorithm for very small numbers. Here we show how…
This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure database of n entries finding a marked element with a…
Quantum metrology aims to exploit quantum phenomena to overcome classical limitations in the estimation of relevant parameters. We consider a probe undergoing a phase shift $\varphi$ whose generator is randomly sampled according to a…
Logic entailment is essential to reasoning, but entailment checking has the worst-case complexity of an exponential of the variable size. With recent development, quantum computing when mature may allow an effective approach for various…
We introduce a new information theoretic measure of quantum correlations for multiparticle systems. We use a form of multivariate mutual information -- the interaction information and generalize it to multiparticle quantum systems. There…
Destructive quantum interference in electron transport through molecules provides an unconventional route for suppressing electric current. In this work we introduce "interference vectors" for each interference and use them to characterize…
Quantum search algorithm (also known as Grover's algorithm) lays the foundation for many other quantum algorithms. Although it is very simple, its implementation is limited on noisy intermediate-scale quantum (NISQ) processors. Grover's…
This paper presents a computer program, written in Maple, that allows a user to simulate certain aspects of Shor's quantum factoring algorithm on a desktop or laptop computer. The program does not simulate the unitary operations carried out…
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…
We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n+3 qubits and O(n^3 lg(n)) elementary quantum gates in a depth of O(n^3) to…