Related papers: Coherence and decoherence in generalized and noisy…
Quantifying coherence is an essential endeavour for both quantum foundations and quantum technologies. Here the robustness of coherence is defined and proven a full monotone in the context of the recently introduced resource theories of…
Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental detection is challenging, usually requiring full reconstruction…
We study the universality of scaling of entanglement in Shor's factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the NP-complete Exact Cover problem as well as the Grover's problem. The…
With a choice of boundary conditions for solutions of the Schr\"odinger equation, state vectors and density operators even for closed systems evolve asymmetrically in time. For open systems, standard quantum mechanics consequently predicts…
We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step…
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-1/2 SU(2) generalized coherent states. Surprisingly, we find evidences that the algorithm's success probability is not too severely…
We present a general denoising algorithm for performing simultaneous tomography of quantum states and measurement noise. This algorithm allows us to fully characterize state preparation and measurement (SPAM) errors present in any quantum…
In recent decades, the field of quantum computing has experienced remarkable progress. This progress is marked by the superior performance of many quantum algorithms compared to their classical counterparts, with Shor's algorithm serving as…
Quantum algorithms allow to outperform their classical counterparts in various tasks, most prominent example being Shor's algorithm for efficient prime factorization on a quantum computer. It is clear that one of the reasons for the speedup…
Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
Noise and decoherence are two major obstacles to the implementation of large-scale quantum computing. Because of the no-cloning theorem, which says we cannot make an exact copy of an arbitrary quantum state, simple redundancy will not work…
The quantum theory of decoherence plays an important role in a pragmatist interpretation of quantum theory. It governs the descriptive content of claims about values of physical magnitudes and offers advice on when to use quantum…
Quantum noise is conventionally viewed as a fundamental obstacle in near-term quantum computing, motivating extensive error correction and mitigation strategies. We present numerical evidence that challenges this consensus. Through…
Two models of computer, a quantum and a classical "chemical machine" designed to compute the relevant part of Shor's factoring algorithm are discussed. The comparison shows that the basic quantum features believed to be responsible for the…
Coherence is a familiar concept in physics: It is the driving force behind wavelike phenomena such as the diffraction of light. Moreover, wave-particle duality implies that all quantum objects can exhibit coherence, and this quantum…
The theory of decoherent histories is an attempt to derive classical physics from positing only quantum laws at the fundamental level without notions of a classical apparatus or collapse of the wave-function. Searching for a marked target…
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…
We study the quantum Fisher information (QFI) per particle of an open (parti- cles can enter and leave the system) and dissipative (far from thermodynamical equilibrium) steady state system of two qubits in a noise which is decoherence. We…
We introduce a procedure based on quantum expectation values of measurement observables to characterize quantum coherence. Our measure allows one to quantify coherence without having to perform tomography of the quantum state, and can be…