Related papers: A Quantitative Measure of Interference
What is the role of coherence in determining the distribution of work done on a quantum system? We approach this question from an operational perspective and consider a setup in which the internal energy of a closed system is recorded by a…
Variational quantum algorithms are promising tools for near-term quantum computers as their shallow circuits are robust to experimental imperfections. Their practical applicability, however, strongly depends on how many times their circuits…
Shor's algorithm, which given appropriate hardware can factorise an integer $N$ in a time polynomial in its binary length $L$, has arguable spurred the race to build a practical quantum computer. Several different quantum circuits…
We propose entropic measures for the strength of single-particle and two-particle interference in interferometric experiments where each particle of a pair traverses a multi-path interferometer. Optimal single-particle interference excludes…
Demonstration of quantum advantage remains challenging due to the increased overhead of controlling large quantum systems. While significant effort has been devoted to qubit-based devices, qudits ($d$-level systems) offer potential…
In present work we study informational measures for the problem of interference of quantum particles. We demonstrate that diffraction picture in the far field, which is given by probability density of particle momentum distribution,…
Within the established theoretical framework of quantum mechanics, interference always occurs between pairs of trajectories. Higher order interferences with multiple constituents are, however, excluded by Born's rule and can only exist in…
The primary objective of this paper is to present an exact and general procedure for mapping any sequence of quantum gates onto a network of probabilistic p-bits which can take on one of two values 0 and 1. The first $n$ p-bits represent…
A quantitative measure of quantum coherence was recently introduced, in the context of quantum information theory. This measure has also been propounded as a good quantifier of the wave nature of quantum objects. However, actually measuring…
The decoherence effect on Grover algorithm has been studied numerically through a noise modelled by a depolarizing channel. Two types of error are introduced characterizing the qubit time evolution and gate application, so the noise is…
We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory qubits and the number of operations required to perform factorization, using the algorithm…
Frequency-encoded quantum information offers intriguing opportunities for quantum communications and networking, with the quantum frequency processor paradigm -- based on electro-optic phase modulators and Fourier-transform pulse shapers --…
Properties of Shor's algorithm and the related period-finding algorithm could serve as benchmarks for the operation of a quantum computer. Distinctive universal behaviour is expected for the probability for success of the period-finding…
We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of "factoring"…
Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. Shor's quantum algorithm for fast number factoring is a key example and the prime motivator in the…
Quantum interference takes center stage in the realm of quantum particles, playing a crucial role in revealing their wave-like nature and probabilistic behavior. It relies on the concept of superposition, where the probability amplitudes of…
Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude…
Distributed computing seems to be a natural approach to overcome size limitations of quantum computers in terms of number of qubits. But one lacks an efficient distribution approach to deal systematically with potential algorithms. This…
The history based formalism known as Quantum Measure Theory (QMT) generalizes the concept of probability-measure so as to incorporate quantum interference. The resulting \textit{quantum measure} $\mu$ is defined for arbitrary events (sets…
Bohr's Complementarity Principle is quantitatively formulated in terms of the distinguishability of various paths a quanton can take, and the measure of the interference it produces. This phenomenon results from the interference of…