Related papers: Coherence as a resource in decision problems: The …
We generalize the Deutsch-Jozsa problem and present a quantum algorithm that can solve the generalized Deutsch-Jozsa problem by a single evaluation of a given function. We discuss the initialization of an auxiliary register and present a…
We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…
Any quantum resource theory is based on free states and free operations, i.e., states and operations which can be created and performed at no cost. In the resource theory of coherence free states are diagonal in some fixed basis, and free…
An extended analysis is given of the program, originally suggested by Deutsch, of solving the probability problem in the Everett interpretation by means of decision theory. Deutsch's own proof is discussed, and alternatives are presented…
We analyse an argument of Deutsch, which purports to show that the deterministic part of classical quantum theory together with deterministic axioms of classical decision theory, together imply that a rational decision maker behaves as if…
Quantum coherence is a fundamental issue in quantum mechanics and quantum information processing. We explore the coherence dynamics of the evolved states in HHL quantum algorithm for solving the linear system of equation…
Quantum coherence is one of the most important resources in quantum information. Indeed, preventing the loss of coherence is one of the most important technical challenges obstructing the development of large-scale quantum computers.…
The quantum component in uncertainty relation can be naturally characterized by the quantum coherence of a quantum state, which is of paramount importance in quantum information science. Here, we experimentally investigate quantum…
This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and…
Quantum coherence quantifies the amount of superposition in a quantum system, and is the reason and resource behind several phenomena and technologies. It depends on the natural basis in which the quantum state of the system is expressed,…
We propose a physical scheme for implementing the Deutsch-Jozsa algorithm using atomic ensembles and optical devices. The scheme has inherent fault tolerance to the realistic noise and efficient scaling with the number of ensembles for some…
The classical methods used by recursion theory and formal logic to block paradoxes do not work in quantum information theory. Since quantum information can exist as a coherent superposition of the classical ``yes'' and ``no'' states,…
The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it allows us to explicitly calculate the time evolution of the…
We consider classical and quantum algorithms which have a duality property: roughly, either the algorithm provides some nontrivial improvement over random or there exist many solutions which are significantly worse than random. This enables…
An approach is presented treating decision theory as a probabilistic theory based on quantum techniques. Accurate definitions are given and thorough analysis is accomplished for the quantum probabilities describing the choice between…
In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large…
We perform quantum interference experiments on a single self-assembled semiconductor quantum dot. The presence or absence of a single exciton in the dot provides a qubit that we control with femtosecond time resolution. We combine a set of…
The Deutsch-Jozsa algorithm is a generalization of the Deutsch algorithm which was the first algorithm written. We present schemes to implement the Deutsch algorithm and the Deutsch-Jozsa algorithm via cavity QED.
The question of which resources drive the advantages in quantum algorithms has long been a fundamental challenge. While entanglement and coherence are critical to many quantum algorithms, our results indicate that they do not fully explain…
The coherent superposition of states, in combination with the quantization of observables, represents one of the most fundamental features that mark the departure of quantum mechanics from the classical realm. Quantum coherence in many-body…