Abstract
We show that a unitary operation (quantum circuit) secretly chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations are required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.
Introduction
A fundamental challenge in quantum information science is the discrimination of non-orthogonal quantum states, which cannot be done with 100% certainty. However, the task of distinguishing between two different unitary operations (quantum gates), $U$ and $V$, is different. If one is allowed to run the unknown gate multiple times, perfect discrimination becomes possible.
Historically, the standard approach to this problem was the parallel scheme. This involved preparing a highly entangled state across multiple qubits, passing parts of that state through multiple copies of the unknown gate simultaneously, and then performing a joint measurement. Because entanglement is a complex and expensive resource, it was long assumed to be the essential ingredient for achieving perfect discrimination. This paper challenges that assumption, demonstrating that a single-system sequential approach can achieve the same results without any entanglement.
The Sequential Scheme
The authors propose a Sequential Scheme that utilizes a single $d$-dimensional quantum system (a qudit) rather than an entangled multi-qubit system. The process is iterative and relies on temporal resources rather than spatial ones:
- Preparation: The process begins with a specific initial state $|\psi\rangle$.
- Iteration: The unknown gate $O$ (either $U$ or $V$) is applied, followed by a carefully chosen "auxiliary" unitary rotation $X_i$.
- Repetition: This sequence is repeated $N$ times. The final state is represented by the operation: $| \psi_{final} \rangle = O X_{N-1} O \dots X_1 O |\psi\rangle$.
- Measurement: A standard projective measurement is performed on the qudit.
The core contribution of this work is the constructive proof that for any two distinct unitaries $U$ and $V$, there exists a finite $N$ and a set of auxiliary gates $X_i$ such that the final states corresponding to $U$ and $V$ are perfectly orthogonal. Orthogonal states can be distinguished with 100% certainty through measurement.
Key Insights: Space-Time Trade-offs
This research highlights a fascinating trade-off between spatial resources (the entanglement used in parallel schemes) and temporal resources (the repeated use of a single system in the sequential scheme).
- Entanglement vs. Interference: The "power" of quantum mechanics in this context is shown to stem from interference and the accumulation of phase differences rather than entanglement itself. Sequential runs allow these phase differences to build up until orthogonality is reached.
- Optimality: Remarkably, the sequential scheme requires the exact same number of runs ($N$) as the parallel entangled scheme. There is no efficiency penalty for choosing the simpler, single-system approach.
- Resource Efficiency: Single-qudit operations are generally more economical and easier to implement in a laboratory setting than the generation and maintenance of multi-partite entangled states.
Key Results and Theorems
The paper formalizes these findings through two primary theorems:
- Theorem 1: For any two distinct unitaries, a sequential scheme exists that achieves perfect discrimination. The minimum number of runs required is $N = \lceil \pi / \Theta(U^\dagger V) \rceil$, where $\Theta$ is the length of the smallest arc containing all eigenvalues of the operator on the unit circle.
- Theorem 2: This sequential scheme is optimal. No other scheme, including those utilizing entanglement, can perfectly distinguish the gates in fewer than $N$ runs.
While the paper proves entanglement is unnecessary for two gates, it also notes that the logic extends to discriminating between a finite set of $n$ different unitary operations, though the strategies for $n > 2$ become more complex.
Conclusion
This work demonstrates that entanglement is not a prerequisite for perfect discrimination between unitary operations. By substituting spatial entanglement with temporal sequences, researchers can achieve optimal results using simpler hardware. Future work may explore the experimental realization of these sequential circuits and investigate whether entanglement provides a scaling advantage when discriminating between very large sets of candidate gates.
Summary updated