Add to ORKGThe intrinsic idea of superdense coding is to find as many gates as possible such that they can be perfectly discriminated. In this paper, we consider a basic scheme of discrimination of quantum gates, called ancilla-assisted discrimination, in which a
We prove a lower bound on the q-maximal fidelities between two quantum channels ε 0 and ε 1 and an u...
We present the solution to the problem of optimally discriminating among quantum states, i.e., ident...
The problem of discriminating between non-orthogonal states is one that has generated a lot of inter...
The intrinsic idea of superdense coding is to find as many gates as possible such that they can be p...
Abstract. We assess the resources needed to identify a reversible quantum gate among a finite set of...
We assess the resources needed to identify a reversible quantum gate among a finite set of alternati...
We quantify the usefulness of a bipartite quantum state in the ancilla-assisted channel discriminati...
We investigate the problem of finding the minimum number of queries needed to perfectly identify an ...
An unknown unitary gate, which is secretly chosen from several known ones, can always be distinguish...
© Giulio Chiribella, Giacomo Mauro D'Ariano, and Martin Roetteler;. We investigate the problem of fi...
We discuss the problem of designing unambiguous programmable discriminators for any $n$ unknown quan...
We investigate some properties of programmed quantum-state discriminators with simple prog...
We investigate some properties of programmed quantum-state discriminators with simple programs. Berg...
Discrimination of unitary operations is fundamental in quantum computation and information. A lot of...
We propose two experimental schemes for quantum state discrimination that achieve the optimal tradeo...
We prove a lower bound on the q-maximal fidelities between two quantum channels ε 0 and ε 1 and an u...
We present the solution to the problem of optimally discriminating among quantum states, i.e., ident...
The problem of discriminating between non-orthogonal states is one that has generated a lot of inter...
The intrinsic idea of superdense coding is to find as many gates as possible such that they can be p...
Abstract. We assess the resources needed to identify a reversible quantum gate among a finite set of...
We assess the resources needed to identify a reversible quantum gate among a finite set of alternati...
We quantify the usefulness of a bipartite quantum state in the ancilla-assisted channel discriminati...
We investigate the problem of finding the minimum number of queries needed to perfectly identify an ...
An unknown unitary gate, which is secretly chosen from several known ones, can always be distinguish...
© Giulio Chiribella, Giacomo Mauro D'Ariano, and Martin Roetteler;. We investigate the problem of fi...
We discuss the problem of designing unambiguous programmable discriminators for any $n$ unknown quan...
We investigate some properties of programmed quantum-state discriminators with simple prog...
We investigate some properties of programmed quantum-state discriminators with simple programs. Berg...
Discrimination of unitary operations is fundamental in quantum computation and information. A lot of...
We propose two experimental schemes for quantum state discrimination that achieve the optimal tradeo...
We prove a lower bound on the q-maximal fidelities between two quantum channels ε 0 and ε 1 and an u...
We present the solution to the problem of optimally discriminating among quantum states, i.e., ident...
The problem of discriminating between non-orthogonal states is one that has generated a lot of inter...