Fast simulation for multi-photon, atomic-ensemble quantum model of linear optical systems addressing the curse of dimensionality.

Photons are elementary particles of light in quantum mechanics, whose dynamics can be difficult to gain detailed insights, especially in complex systems. Simulation is a promising tool to resolve this issue, but it must address the curse of dimensionality, namely, that the number of bases increases exponentially in the number of photons. Here we mitigate this dimensionality scaling by focusing on optical systems composed of linear optical objects, modeled as an ensemble of two-level atoms. We decompose the time evolutionary operator on multiple photons into a group of time evolution operators acting on a single photon. Since the dimension of a single-photon time evolution operator is exponentially smaller than that of a multi-photon one in the number of photons, the decomposition enables the multi-photon simulations to be performed at a much lower computational cost. We apply this method to basic single- and multi-photon phenomena, such as Hong-Ou-Mandel interference and violation of the Bell-CHSH inequality, and confirm that the calculated properties are quantitatively comparable to the experimental results. Furthermore, our method visualizes the spatial propagation of photons hence provides insights that aid experiment designs for quantum-enabled technologies.

Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly.

We report a deterministic and exact protocol to reverse any unknown qubit-unitary operation, which simulates the time inversion of a closed qubit system. To avoid known no-go results on universal deterministic exact unitary inversion, we consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model, where the input unitary operation is called multiple times in sequence and fixed quantum circuits are inserted between the calls. In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation, and the output state in an auxiliary system can be reused as a catalyst state in another run of the unitary inversion. We also present the simplification of the semidefinite programming for searching the optimal deterministic unitary inversion protocol for an arbitrary dimension presented by M. T. Quintino and D. Ebler [Quantum 6, 679 (2022)2521-327X10.22331/q-2022-03-31-679]. We show a method to reduce the large search space representing all possible protocols, which provides a useful tool for analyzing higher-order quantum transformations for unitary operations.

Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation.

The repeat-until-success strategy is a standard method to obtain success with a probability that grows exponentially with the number of iterations. However, since quantum systems are disturbed after a quantum measurement, how to perform repeat-until-success strategies in certain quantum algorithms is not straightforward. In this Letter, we propose a new structure for probabilistic higher-order transformation named success-or-draw, which allows a repeat-until-success implementation. For that we provide a universal construction of success-or-draw structure that works for any probabilistic higher-order transformation on unitary operations. We then present a semidefinite programming approach to obtain optimal success-or-draw protocols and analyze in detail the problem of inverting a general unitary operation.

Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations.

Given a quantum gate implementing a d-dimensional unitary operation U_{d}, without any specific description but d, and permitted to use k times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse U_{d}^{-1}, whose failure probability decays exponentially in k. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires that k≥d-1, proven necessary for the exact implementation of U_{d}^{-1} with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, k≥d-1 uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given k and d. The optimal values are computed using semidefinite programing solvers for k≤3 when d=2 and k≤2 for d=3. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.

Complexity of Causal Order Structure in Distributed Quantum Information Processing: More Rounds of Classical Communication Reduce Entanglement Cost.

We prove a trade-off relation between the entanglement cost and classical communication round complexity of a protocol in implementing a class of two-qubit unitary gates by two distant parties, a key subroutine in distributed quantum information processing. The task is analyzed in an information theoretic scenario of asymptotically many input pairs with a small error that is required to vanish sufficiently quickly. The trade-off relation is shown by (i) one ebit of entanglement per pair is necessary for implementing the unitary by any two-round protocol, and (ii) the entanglement cost by a three-round protocol is strictly smaller than one ebit per pair. We also provide an example of bipartite unitary gates for which there is no such trade-off.

Quantum algorithm for universal implementation of the projective measurement of energy.

A projective measurement of energy (PME) on a quantum system is a quantum measurement determined by the Hamiltonian of the system. PME protocols exist when the Hamiltonian is given in advance. Unknown Hamiltonians can be identified by quantum tomography, but the time cost to achieve a given accuracy increases exponentially with the size of the quantum system. In this Letter, we improve the time cost by adapting quantum phase estimation, an algorithm designed for computational problems, to measurements on physical systems. We present a PME protocol without quantum tomography for Hamiltonians whose dimension and energy scale are given but which are otherwise unknown. Our protocol implements a PME to arbitrary accuracy without any dimension dependence on its time cost. We also show that another computational quantum algorithm may be used for efficient estimation of the energy scale. These algorithms show that computational quantum algorithms, with suitable modifications, have applications beyond their original context.

Contextuality in bosonic bunching.

In the classical probability theory a sum of probabilities of three pairwise exclusive events is always bounded by one. This is also true in quantum mechanics if these events are represented by pairwise orthogonal projectors. However, this might not be true if the three events refer to a system of indistinguishable particles. We show that one can find three pairwise exclusive events for a system of three bosonic particles whose corresponding probabilities sum to 3/2. This can be done under assumptions of realism and noncontextuality, i.e., that it is possible to assign outcomes to events before measurements are performed and in a way that does not depend on a particular measurement setup. The root of this phenomenon comes from the fact that for indistinguishable particles there are events that can be deduced to be exclusive under the aforementioned assumptions, but at the same time are complementary because the corresponding projectors are not orthogonal.

Generalized monogamy of contextual inequalities from the no-disturbance principle.

In this Letter, we demonstrate that the property of monogamy of Bell violations seen for no-signaling correlations in composite systems can be generalized to the monogamy of contextuality in single systems obeying the Gleason property of no disturbance. We show how one can construct monogamies for contextual inequalities by using the graph-theoretic technique of vertex decomposition of a graph representing a set of measurements into subgraphs of suitable independence numbers that themselves admit a joint probability distribution. After establishing that all the subgraphs that are chordal graphs admit a joint probability distribution, we formulate a precise graph-theoretic condition that gives rise to the monogamy of contextuality. We also show how such monogamies arise within quantum theory for a single four-dimensional system and interpret violation of these relations in terms of a violation of causality. These monogamies can be tested with current experimental techniques.

Entanglement cost of implementing controlled-unitary operations.

We investigate the minimum entanglement cost of the deterministic implementation of two-qubit controlled-unitary operations using local operations and classical communication (LOCC). We show that any such operation can be implemented by a three-turn LOCC protocol, which requires at least 1 ebit of entanglement when the resource is given by a bipartite entangled state with Schmidt number 2. Our result implies that there is a gap between the minimum entanglement cost and the entangling power of controlled-unitary operations. This gap arises due to the requirement of implementing the operations while oblivious to the identity of the inputs.