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 with a postselection scheme conditioned on the measurement result obtained on one of the qubits of the pair. The resulting transformation is a deterministic, nonlinear, chaotic map in the Hilbert space. We derive a class of these transformations capable of orthogonalizing nonorthogonal qubit states after a few iterations. These nonlinear maps orthogonalize states which correspond to the two different convergence regions of the nonlinear map. Based on the analysis of the border (the so-called Julia set) between the two regions of convergence, we show that it is always possible to find a map capable of deciding whether an unknown state is within a neighborhood of fixed radius around a desired quantum state. We analyze which one- and two-qubit operations would physically realize the scheme. It is possible to find a single two-qubit unitary gate for each map or, alternatively, a universal special two-qubit gate together with single-qubit gates in order to carry out the task. We note that it is enough to have a single physical realization of the required gates due to the iterative nature of the scheme.
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 with a postselection scheme conditioned on the measurement result obtained on one of the qubits of the pair. The resulting transformation is a deterministic, nonlinear, chaotic map in the Hilbert space. We derive a class of these transformations capable of orthogonalizing nonorthogonal qubit states after a few iterations. These nonlinear maps orthogonalize states which correspond to the two different convergence regions of the nonlinear map. Based on the analysis of the border (the so-called Julia set) between the two regions of convergence, we show that it is always possible to find a map capable of deciding whether an unknown state is within a neighborhood of fixed radius around a desired quantum state. We analyze which one- and two-qubit operations would physically realize the scheme. It is possible to find a single two-qubit unitary gate for each map or, alternatively, a universal special two-qubit gate together with single-qubit gates in order to carry out the task. We note that it is enough to have a single physical realization of the required gates due to the iterative nature of the scheme.
We experimentally realize a nonlinear quantum protocol for single-photon qubits with linear optical elements and appropriate measurements. Quantum nonlinearity is induced by postselecting the polarization qubit based on a measurement result obtained for the spatial degree of freedom of the single photon which plays the role of a second qubit. Initially, both qubits are prepared in the same quantum state and an appropriate two-qubit unitary transformation entangles them before the measurement of the spatial part. We analyze the result by quantum state tomography of the polarization degree of freedom. We then demonstrate the usefulness of the protocol for quantum state discrimination by iteratively applying it to either of two slightly different quantum states which rapidly converge to different orthogonal states by the iterative dynamics. Our work creates an opportunity to employ effective quantum nonlinear evolution in quantum information processing.
We study measurement-induced nonlinear dynamics generated by an iterated quantum protocol combining an entangling gate, a single-qubit rotation, and post-selection. For pure single-qubit inputs, a particular choice of the single-qubit unitary yields globally chaotic, strongly mixing dynamics that explores the entire Bloch sphere, providing a physical realization of ergodic behavior in a complex map. We extend the analysis to realistic, noisy preparation by considering mixed initial states and the induced nonlinear evolution inside the Bloch sphere. Numerical results show that the maximally mixed state is an attractor for mixed inputs, although many trajectories exhibit transient increases in purity before ultimately converging. To quantify robustness against noise, we introduce a practical notion of quasi-ergodicity: ensembles prepared in a small angular patch at fixed purity rapidly spread to cover all directions, while the purity gradually decreases toward its minimal value. By varying the final single-qubit gate, we identify a broad family of protocols that remain ergodic-like for pure states, supported by consistent diagnostics including the absence of attracting cycles, agreement of time and ensemble statistics, rapid spreading from localized regions, and exponential sensitivity to initial conditions. Away from the special globally mixing case, the mixed-state dynamics can change qualitatively: for most ergodic-like parameters, a finite subset of noisy inputs is driven toward purification rather than complete mixing, demonstrating the coexistence of statistical mixing and purification within a single iterated protocol.
We study measurement-induced nonlinear dynamics generated by an iterated quantum protocol combining an entangling gate, a single-qubit rotation, and post-selection. For pure single-qubit inputs, a particular choice of the single-qubit unitary yields globally chaotic, strongly mixing dynamics that explores the entire Bloch sphere, providing a physical realization of ergodic behavior in a complex map. We extend the analysis to realistic, noisy preparation by considering mixed initial states and the induced nonlinear evolution inside the Bloch sphere. Numerical results show that the maximally mixed state is an attractor for mixed inputs, although many trajectories exhibit transient increases in purity before ultimately converging. To quantify robustness against noise, we introduce a practical notion of quasi-ergodicity: ensembles prepared in a small angular patch at fixed purity rapidly spread to cover all directions, while the purity gradually decreases toward its minimal value. By varying the final single-qubit gate, we identify a broad family of protocols that remain ergodic-like for pure states, supported by consistent diagnostics, including the absence of attracting cycles, agreement of time and ensemble statistics, rapid spreading from localized regions, and exponential sensitivity to initial conditions. Away from the special globally mixing case, the mixed-state dynamics can change qualitatively: for most ergodic-like parameters, a finite subset of noisy inputs is driven toward purification rather than complete mixing, demonstrating the coexistence of statistical mixing and purification within a single iterated protocol.
I study a promise problem for an unknown unitary operator acting on an n-qubit system. The operator is promised to take one of two forms: either it implements a fixed permutation of computational basis states, or it implements the same permutation together with a conditional sign change determined by a designated input qubit. I show that these two cases can be distinguished with certainty using a single query to the unknown operator and a measurement of only one qubit. The procedure requires no ancilla qubits and uses only n+1 Hadamard gates in addition to the oracle call. The promise is intrinsically quantum, since the two cases differ only in their relative-phase structure and therefore have no direct classical counterpart in the usual black-box model.
Deterministically cloning (copying) nonorthogonal states is forbidden in quantum mechanics, but deterministic pseudo-unitary cloning is possible in a nonunitary system. We prove and show that, for any two nonorthogonal qubit states, we can find a linear, invertible Hermitian (metric) operator to make these states mutually orthogonal with respect to the corresponding pseudo-inner product. From this metric operator, we construct a pseudo-Hermitian Hamiltonian and its evolution operator as an ideal, deterministic pseudo-unitary cloner. For applicability, suppose Alice lives in our ordinary universe and Bob lives in a universe that has the desired pseudo-unitary evolution. Alice would send her nonorthogonal states to Bob and Bob would do the cloning deterministically and send back to Alice. The quantum channel will be lossy not due to Bob's universe's properties, but rather due to problems making a channel between the two universes. We experimentally demonstrate deterministic pseudo-unitary two-qubit cloning for a photonic pseudo-unitary two-qubit system. In our universe we have to demonstrate that universe by executing a postselected gate that effects loss-based pseudo-unitary evolution. Furthermore, we introduce an algorithmic method for designing experimental realizations of a generic class of nonunitary operators for pseudo-unitary cloning.
Quantum state discrimination is one of the most fundamental tasks in quantum information since it describes the read-out process of classical information from quantum states in quantum communications.In quantum state discrimination, a given test state is guaranteed to be identical to one of a set of candidate quantum states.The task is to determine the identity of the test state by performing an appropriate quantum measurement based on the classical descriptions of the candidate states.Quantum state discrimination also has several connections to the principles of quantum mechanics such as the no-cloning theorem and the no-signaling principle.One of fundamental properties of quantum mechanics is that the exact classical description of unknown quantum states cannot be retrieved from a single copy of the physical state.Quantum state discrimination in the case that the candidate states are given as two unknown physical states (reference states) but their classical descriptions are not given, has been investigated.The two reference states are labeled one and two, respectively.The task is to determine which of the two reference states is equivalent to the test state, whereas the descriptions of the states are not of interest.We call such a task as equivalence determination of quantum states.Discrimination of quantum operations has been also investigated and it has been shown that there is an intrinsic difference between discrimination of quantum state and discrimination of quantum operations.We analyze a unitary operation version of the equivalence determination task by using the concept of higher-order quantum computation to investigate properties of discrimination of other quantum objects.We consider three black-boxes (test box and reference boxes) implementing unknown unitary operations given as physical systems.The test box is guaranteed to implement one of the two unitary operations given by the reference boxes.Equivalence determination of unitary operations is a task to determine the reference box implementing the same unitary operation as the one by the test box.We assume that the unitary operations of the reference boxes are randomly sampled from the Haar measure of SU(2).We first consider the case that each of three black-boxes can be used only once both in parallel and ordered uses of the black-boxes.We show that the optimal success probability for equivalence determination is 7/8 by obtaining analytical solutions of the corresponding semidefinite programmings (SDPs) both in the parallel and ordered strategies.The optimal success probability can be achieved even without using one of the reference boxes.We also showed that entanglement of an initial state across the systems on which the reference boxes act and the test box acts is necessary to achieve the optimal success probability.We then consider the case that the multiple uses of the reference boxes are allowed.We consider the parallel strategies up to four uses of each of the reference boxes and obtain the optimal success probabilities by numerically solving the semidefinite programmings.We numerically show that the ordered strategies give improvement over the parallel strategies and the optimal success probability varies depending on the order of the black-boxes when one reference box is used once and the other reference box is used twice.This result indicates that an appropriate order of the black-boxes under the ordered strategies is necessary to obtain improvement over the parallel strategies. Chapter 1 Introduction Notations• H i , K j : Hilbert spaces labeled with i and j.• L(H): The set of linear operators on H.• L(H, K): The set of linear operators from H to K.• S(H) : The set of positive semidefinite linear operation of unit trace on H • Tr H : The partial trace over H • U † : The conjugate transpose of U • {Π i }: The positive operator-valued measure • { Π i }: The quantum tester • δ ij : The Kronecker delta, equal to 1 if i = j and 0 otherwise • dµ(•) : The Haar measure, the uniform distribution of the space of unitary operations • |I⟩⟩ : Unnormalized maximally entangled vector defined as |I⟩⟩ = i |i⟩|i⟩ • M : A quantum channel • M : Choi operator of a quantum channel M• U j : The irreducible subspace of the total angular momentum j.