Identification of a reversible quantum gate: assessing the resources

  title={Identification of a reversible quantum gate: assessing the resources},
  author={Giulio Chiribella and Giacomo Mauro D’Ariano and Martin Roetteler},
  journal={New Journal of Physics},
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… 

Optimal measurement strategies for fast entanglement detection

With the advance of quantum information technology, the question of how to most efficiently test quantum circuits is becoming of increasing relevance. Here we introduce the statistics of lengths of

Multiple-shot and unambiguous discrimination of von Neumann measurements

It is shown that typical pairs of Haar-random von Neumann measurements can be perfectly distinguished with only two queries, and the minimal number of queries needed for perfect discrimination.

Query Complexity of Unitary Operation Discrimination

Capability of local operations and classical communication to distinguish bipartite unitary operations

The problem behind this paper is, if the number of queries to unitary operations is fixed, say $k$, then when do local operations and classical communication (LOCC) suffice for optimally

Quantum $k$-nearest neighbors algorithm

It is shown that the QkNN algorithm can be reduced to an instance of the quantum k maxima algorithm; hence the query complexity ofQkNN is O( √ kM), and the applicability of this algorithm in entanglement classification and quantum state discrimination is shown.

Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies

An absolute upper bound for the maximal probability of successfully discriminating any set of unitary channels with any number of copies for the most general strategies that are suitable for channel discrimination is derived.

Quantum observation scheme universally identifying causalities from correlations

It has long been recognized as a difficult problem to determine whether the observed statistical correlation between two classical variables arise from causality or from common causes. Recent

Reversible Logic: An Introduction

This chapter describes about theory of reversible logic, basic gates, cost matrices used for synthesis and testing of these circuits and connection of reversible Logic with quantum computation.

Quantum speedup in the identification of cause–effect relations

It is established that quantum strategies can provide an exponential speedup in identifying cause–effect relationships in quantum systems.



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

Quantum Oracle Interrogation: Getting All Information for Almost Half the Price

  • W. V. Dam
  • Computer Science, Mathematics
  • 1998
It follows that any function with the N bits of the oracle as input can be calculated using N/2+/spl radic/N queries if the authors allow a small probability of error.

A semidefinite programming approach to optimal unambiguous discrimination of quantumstates

We consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of

Perfect distinguishability of quantum operations.

We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretly selected from a set of known quantum operations can be identified perfectly

Quantum filtering and discrimination between sets of Boolean functions.

An efficient, probabilistic quantum algorithm for distinguishing between sets of Boolean functions, which is a generalization of the Deutsch-Jozsa algorithm is proposed.

Theoretical framework for quantum networks

We present a framework to treat quantum networks and all possible transformations thereof, including as special cases all possible manipulations of quantum states, measurements, and channels, such

Quantum Identification of Boolean Oracles

The OIP contains several concrete problems such as the original Grover search and the Bernstein-Vazirani problem, but the interest is in the quantum query complexity, for which several upper bounds are presented.

Tight bounds on quantum searching

A lower bound on the efficiency of any possible quantum database searching algorithm is provided and it is shown that Grover''s algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table.

Quantum-state filtering applied to the discrimination of Boolean functions

Quantum-state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs. The

Optimal quantum learning of a unitary transformation

The problem of the optimal inversion of an unknown unitary evolution is addressed, showing also in this case the optimality of the 'measure-and-rotate' strategies and applying the result to the optimal approximate realignment of reference frames for quantum communication.