Related papers: A Quantitative Measure of Interference
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric…
The Majorization Principle is a fundamental statement governing the dynamics of information processing in optimal and efficient quantum algorithms. While quantum computation can be modeled to be reversible, due to the unitary evolution…
Grover multiports are higher-dimensional generalizations of beam splitters, in which input to any one of the four ports has equal probability of exiting at any of the same four ports, including the input port. In this paper, we demonstrate…
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for an entanglement measure defined in terms of success rate of Grover's search algorithm…
Distributed quantum computation is the key to high volume computation in the NISQ era. This investigation explores the key aspects necessary for the construction of a quantum network by numerically simulating the execution of the…
We investigate a Mach-Zehnder interferometer fed by two time-dependently driven single-particle sources, one of them placed in front of the interferometer, the other in the center of one of the arms. As long as the two sources are operated…
Quantum interference between interacting systems is fundamental to basic science and quantum technology, but it typically requires precise control of the interaction phases of lasers or microwave generators. Can interference be observed if…
We address the trade-off between information and disturbance in qubit thermometry from the perspective of quantum estimation theory. Given a quantum measurement, we quantify information via the Fisher information of the measurement and…
We examine metrological scenarios where the parameter of interest is encoded onto a quantum state through the action of a noisy quantum gate and investigate the ultimate bound to precision by analyzing the behaviour of the Quantum Fisher…
We consider the possibility to measure the quantum decoherence using gravitational wave interferometers. Gravitational wave interferometers create the superposition state of photons and measure the interference of the photon state. If the…
Shor's factoring algorithm illustrates the potential power of quantum computation. Here we present and numerically investigate a proposal for a compiled version of such an algorithm based on a quantum-wire network exploiting the…
Correlated interference is calculated for a microscopic particle retro-reflecting from two spatially separated scatterers that are free to move, all three of which are treated as quantum bodies: the positions of the particle traversing this…
Different approaches in quantifying environmentally-induced decoherence are considered. We identify a measure of decoherence, derived from the density matrix of the system of interest, that quantifies the environmentally induced error,…
Grover's algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the marked and unmarked…
An important problem in cognitive radar is to enhance the estimation performance of the system by a joint design of its probing signal and receive filter using the a priori information on interference. In such cases, the knowledge of…
We analyze the interference of individual photons in a linear-optical setup comprised of two overlapping Mach-Zehnder interferometers joined via a common beam splitter. We show how, in this setup, two kinds of standard interference effects…
The implementation and practicality of quantum algorithms highly hinge on the quality of operations within a quantum processor. Therefore, including realistic error models in quantum computing simulation platforms is crucial for testing…
We describe an array of quantum gates implementing Shor's algorithm for prime factorization in a quantum computer. The array includes a circuit for modular exponentiation with several subcomponents (such as controlled multipliers, adders,…
The circuit model of quantum computation is reformulated as a multilayer network theory [3] called a Quantum Multiverse Network (QuMvN). The QuMvN formulation allows us to interpret the quantum wave function as a combination of ergodic…
Shor's algorithm is one of the most significant quantum algorithms. Shor's algorithm can factor large integers with a certain success probability in polynomial time. However, Shor's algorithm requires an unbearable amount of qubits in the…