Related papers: A Quantitative Measure of Interference
Inserting a lossy dielectric into one arm of an interference experiment acts in many ways like a measurement. If two entangled photons are passed through the interferometer, a certain amount of information is gained about which path they…
Quantum advantage requires overcoming noise-induced degradation of quantum systems. Conventional methods for reducing noise such as error mitigation face scalability issues in deep circuits. Specifically, noise hampers the extraction of…
We demonstrate that, in the case of Shor's algorithm for factoring, highly mixed states will allow efficient quantum computation, indeed factorization can be achieved efficiently with just one initial pure qubit and a supply of initally…
Born's rule, one of the cornerstones of quantum mechanics, relates detection probabilities to the modulus square of the wave function. Single-particle interference is accordingly limited to pairs of quantum paths and higher-order…
The desired interference required for quantum computing may be modified by the wave function oscillations for the implementation of quantum algorithms[Phys.Rev.Lett.84(2000)1615]. To diminish such detrimental effect, we propose a scheme…
The formation of multipartite quantum entanglement by repeated operation of one and two qubit gates is examined. The resulting entanglement is evaluated using two measures: the average bipartite entanglement and the Groverian measure. A…
The eigenvalue density of a matrix plays an important role in various types of scientific computing such as electronic-structure calculations. In this paper, we propose a quantum algorithm for computing the eigenvalue density in a given…
Measurement is a fundamental operation in quantum computing and has many important use cases in quantum algorithms. This article provides a comprehensive overview of the basic measurement operations in quantum computing and represents a…
We have implemented an optical quantum eraser with the aim of studying this phenomenon in the context of state discrimination. An interfering single photon is entangled with another one serving as a which-path marker. As a consequence, the…
The method of noisy multiqubit quantum circuits modeling is proposed. The analytical formulas for the dependence of quantum algorithms accuracy on qubits count and noise level are obtained for Grover algorithm and quantum Fourier transform.…
The von Neumann and quantum R\'enyi entropies characterize fundamental properties of quantum systems and lead to theoretical and practical applications in many fields. Quantum algorithms for estimating quantum entropies, using a quantum…
It is known that quantum interference can disappear with the mere possibility of distinguishability without actually performing the act. We create such distinguishability in an unbalanced SU(1,1) interferometer and indeed observe no…
Quantifying quantum coherence is a key task in the resource theory of coherence. Here we establish a good coherence monotone in terms of a state conversion process, which automatically endows the coherence monotone with an operational…
Grover's search algorithm was a groundbreaking advancement in quantum algorithms, displaying a quadratic speed-up of querying for items. Since the creation of this algorithm it has been utilized in various ways, including in preparing…
Quantum mechanics and gravitation are two pillars of modern physics. Despite their success in describing the physical world around us, they seem to be incompatible theories. There are suggestions that one of these theories must be…
Classically, wave interference is a phenomenon that can be explained by considering only the waves themselves, that is, without the need to consider the apparatus that monitors or observes them. Thus, in classical theories, interference can…
We study the statistics of quantum interference for completely positive maps. We calculate analytically the mean interference and its second moment for finite dimensional quantum systems interacting with a simple environment consisting of…
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…
Quantum algorithms face significant challenges due to qubit susceptibility to environmental noise, and quantum error correction typically requires prohibitive resource overhead. This paper proposes that quantum algorithms may possess…
A quantum computer is a multi-particle interferometer that comprises beam splitters at both ends and arms, where the n two-level particles undergo the interactions among them. The arms are designed so that relevant functions required to…