829 research outputs found
Identification of a reversible quantum gate: assessing the resources
We assess the resources needed to identify a reversible quantum gate among a
finite set of alternatives, including in our analysis both deterministic and
probabilistic strategies. Among the probabilistic strategies we consider
unambiguous gate discrimination, where errors are not tolerated but
inconclusive outcomes are allowed, and we prove that parallel strategies are
sufficient to unambiguously identify the unknown gate with minimum number of
queries. This result is used to provide upper and lower bounds on the query
complexity and on the minimum ancilla dimension. In addition, we introduce the
notion of generalized t-designs, which includes unitary t-designs and group
representations as special cases. For gates forming a generalized t-design we
give an explicit expression for the maximum probability of correct gate
identification and we prove that there is no gap between the performances of
deterministic strategies an those of probabilistic strategies. Hence,
evaluating of the query complexity of perfect deterministic discrimination is
reduced to the easier problem of evaluating the query complexity of unambiguous
discrimination. Finally, we consider discrimination strategies where the use of
ancillas is forbidden, providing upper bounds on the number of additional
queries needed to make up for the lack of entanglement with the ancillas.Comment: 24 + 8 pages, published versio
Unambiguous discrimination among oracle operators
We address the problem of unambiguous discrimination among oracle operators.
The general theory of unambiguous discrimination among unitary operators is
extended with this application in mind. We prove that entanglement with an
ancilla cannot assist any discrimination strategy for commuting unitary
operators. We also obtain a simple, practical test for the unambiguous
distinguishability of an arbitrary set of unitary operators on a given system.
Using this result, we prove that the unambiguous distinguishability criterion
is the same for both standard and minimal oracle operators. We then show that,
except in certain trivial cases, unambiguous discrimination among all standard
oracle operators corresponding to integer functions with fixed domain and range
is impossible. However, we find that it is possible to unambiguously
discriminate among the Grover oracle operators corresponding to an arbitrarily
large unsorted database. The unambiguous distinguishability of standard oracle
operators corresponding to totally indistinguishable functions, which possess a
strong form of classical indistinguishability, is analysed. We prove that these
operators are not unambiguously distinguishable for any finite set of totally
indistinguishable functions on a Boolean domain and with arbitrary fixed range.
Sets of such functions on a larger domain can have unambiguously
distinguishable standard oracle operators and we provide a complete analysis of
the simplest case, that of four functions. We also examine the possibility of
unambiguous oracle operator discrimination with multiple parallel calls and
investigate an intriguing unitary superoperator transformation between standard
and entanglement-assisted minimal oracle operators.Comment: 35 pages. Final version. To appear in J. Phys. A: Math. & Theo
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
Quantum computing is powerful because unitary operators describing the
time-evolution of a quantum system have exponential size in terms of the number
of qubits present in the system. We develop a new "Singular value
transformation" algorithm capable of harnessing this exponential advantage,
that can apply polynomial transformations to the singular values of a block of
a unitary, generalizing the optimal Hamiltonian simulation results of Low and
Chuang. The proposed quantum circuits have a very simple structure, often give
rise to optimal algorithms and have appealing constant factors, while usually
only use a constant number of ancilla qubits. We show that singular value
transformation leads to novel algorithms. We give an efficient solution to a
certain "non-commutative" measurement problem and propose a new method for
singular value estimation. We also show how to exponentially improve the
complexity of implementing fractional queries to unitaries with a gapped
spectrum. Finally, as a quantum machine learning application we show how to
efficiently implement principal component regression. "Singular value
transformation" is conceptually simple and efficient, and leads to a unified
framework of quantum algorithms incorporating a variety of quantum speed-ups.
We illustrate this by showing how it generalizes a number of prominent quantum
algorithms, including: optimal Hamiltonian simulation, implementing the
Moore-Penrose pseudoinverse with exponential precision, fixed-point amplitude
amplification, robust oblivious amplitude amplification, fast QMA
amplification, fast quantum OR lemma, certain quantum walk results and several
quantum machine learning algorithms. In order to exploit the strengths of the
presented method it is useful to know its limitations too, therefore we also
prove a lower bound on the efficiency of singular value transformation, which
often gives optimal bounds.Comment: 67 pages, 1 figur
- …