Related papers: Distinguishing symmetric quantum oracles and quant…
When two or more subsystems of a quantum system interact with each other they can become entangled. In this case the individual subsystems can no longer be described as pure quantum states. For systems with only 2 subsystems this…
The discrimination of any pair of unknown quantum states is performed by devices processing three parts of inputs: copies of the pair of unknown states we want to discriminate are respectively stored in two program systems and copies of…
We show how to optimally unambiguously discriminate between two subspaces of a Hilbert space. In particular we suppose that we are given a quantum system in either the state \psi_{1}, where \psi_{1} can be any state in the subspace S_{1},…
Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…
Algorithms with unitary oracles can be nested, which makes them extremely versatile. An example is the phase estimation algorithm used in many candidate algorithms for quantum speed-up. The search for new quantum algorithms benefits from…
We consider the Unambiguous State Discrimination (USD) of two mixed quantum states. We study the rank and the spectrum of the elements of an optimal USD measurement. This naturally leads to a partial fourth reduction theorem. This theorem…
We consider the task of deciding whether an unknown qubit state falls in a prescribed neighborhood of a reference state. We assume that several copies of the unknown state are given and apply a unitary operation pairwise on them combined…
We investigate the extent to which two particles can be maximally entangled when they are also similarly entangled with other particles on a complete graph, focusing on Werner, isotropic, and Brauer states. To address this, we formulate and…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
Deutsch's algorithm for two qubits (one control qubit plus one auxiliary qubit) is extended to two $d$-dimensional quantum systems or qudits for the case in which $d$ is equal to $2^n$, $n=1,2,...$ . This allows one to classify a certain…
Twirling operations, which average a quantum state with respect to a unitary subgroup, have become a frequently-employed tool in quantum information processing. We investigate the efficient implementation of twirling operations with minimal…
We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…
In this paper, we address the problem of discriminating two given quantum operations. Firstly, based on the Bloch representation of single qubit systems, we give the exact minimum error probability of discriminating two single qubit quantum…
Discriminating between quantum states is a fundamental problem in quantum information protocols. The optimum approach saturates the Helstrom bound, which quantifies the unavoidable error probability of mistaking one state for another.…
Hilbert space operators may be mapped onto a space of ordinary functions (operator symbols) equipped with an associative (but noncommutative) star-product. A unified framework for such maps is reviewed. Because of its clear probabilistic…
A measurement strategy is developed for a new kind of hypothesis testing. It assigns, with minimum probability of error, the state of a quantum system to one or the other of two complementary subsets of a set of N given non-orthogonal…
Maximally entangled bipartite unitary operators or gates find various applications from quantum information to being building blocks of minimal models of many-body quantum chaos, and have been referred to as "dual unitaries". Dual unitary…
In this work we address two questions concerning Grover's algorithm. In the first we give an answer to the question how to employ Grover's algorithm for actual search over database. We introduce a quantum model of an unordered phone book…
It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. This property ensures the security of quantum key distribution. It is therefore an important task in quantum communication to design and…
A formula for the commutator of tensor product matrices is used to shows that, for qubits, compatibility of quantum multiparty observables almost never implies local compatibility at each site and to predict when this happens/does not…