So far, we have kept our attention confined to closed quantum systems—ones that can be thought of as perfectly isolated from their surroundings and thus evolve via unitary operators, except when we take measurements. (We also need to intervene to prepare input states and to control which gates are applied when, but these gates are still unitary, so we can imagine the system obeying unitary evolution until we measure.) This is not at all realistic; it is impossible to isolate a quantum system entirely from environmental noise. A physical system that—whether we like or not—couples with one or more other systems (collectively called the environment ) is called an open system. In this chapter, we start our discussion of quantum channels, which model open quantum systems. A quantum channel is a certain linear map that maps states in one ℂ-space to states in another. All physical processes that we will encounter, including unitary evolution, measurements, quantum communication, noise, etc., or any combination of these, can be modeled mathematically as quantum channels.
Gaussian operations, as one usually refers to CP-maps that send Gaussian states to Gaussian states, are apt to model a wide range of situations of practical interest and may often be controlled and applied on demand in the laboratory, in a variety of set-ups (that will be the subject matter of Chapter 9 ). Furthermore, they can be classified in a hierarchy of compact, powerful and far-reaching theoretical descriptions, which will be introduced by degrees and discussed in the current chapter. Note that here we are dealing with discrete quantum operations, rather than dynamical equations, which will be dealt with in the next chapter. We shall start from Gaussian unitary operations, corresponding to the symplectic group already introduced in Chapter 3 , and will also clarify how other basic manipulations such as tensoring and partial tracing carry over to the Gaussian picture. Then, we shall broaden our view to include all deterministic (trace-preserving) maps resulting from Gaussian unitary dilations, which are often known as the set of ‘bosonic Gaussian channels’ and encompass open dynamics subject to noise and ‘decoherence’ (the loss of quantum coherence due to the interaction with an environment). Next, we will move on to consider POVMs corresponding to the well-known homodyne and heterodyne detection schemes which, when acting on a subsystem, preserve the Gaussian character of the initial state both when the system is filtered by recording the measurement outcomes, and when acting unconditionally (that is, when the outcome of the measurement is not recorded). Our description will be further enlarged to the wider class of ‘general-dyne’ detections, and we will also introduce methods to account for imperfect detections. The ability to accommodate noise in the analytical description, often daunting with discrete variable and, more generally, outside the Gaussian regime, is probably one of the greatest strengths of the formalism under discussion. Finally, we shall introduce the Gaussian version of the Choi–Jamiolkowski isomorphism, and attain a unified description of all the Gaussian maps previously defined. Throughout our exposition, we will refer to quantum optical systems to exemplify the practical relevance of the operations encountered.
Quantum circuit optimization is an indispensable component of the quantum software stack, used to reduce noise, maximize performance, alleviate costs of quantum error correction, or target specific hardware. A related problem is approximate membership: for a fixed set of unitaries
S, decide whether a given circuit
C is within distance
ε of a unitary in
S under some metric
m. Membership is a special case of optimization, where
S is a set of unitaries implementable at no cost (e.g., with noise-minimal circuits, or without magic states). Janzing, Wocjan, and Beth (Int. J. Quantum Inf., 2005) showed that, for the operator metric, the case
S={I} (approximate identity) is QMA-complete when
C is promised to be either close to the identity or far from it.
We generalize this setting in three directions: (i) promise-free inputs, (ii) besides
S={I}, sets
S containing only Clifford unitaries, or only generalized permutation matrices (i.e., no superposition), and (iii) the trace-based, spectral, and operator metrics. We show that, in all cases, approximate membership is PP-hard for wide ranges of
ε, provided
C's gate-set can implement Clifford+T, as the gate-sets of standard hardware do. If
S={I}, or if
S contains only generalized permutation matrices,
I∈S, and
m is a trace-based distance, PP-hardness holds for all non-trivial
ε. If
S={I} and
m is a trace-based distance, PP-hardness holds even for circuits over classical-reversible gate-sets.
Our results indicate that approximate membership is harder over promise-free inputs than the QMA-complete promise version, and that this hardness persists across quantum resources (any gates, non-Clifford, superposition) and distance metrics. They directly imply PP-hardness of circuit optimization when minimizing total, non-Clifford, or superposition gate depth or count.
A set of classical or quantum states is equivalent to another one if there exists a pair of classical or quantum channels mapping either set to the other one. For dichotomies (pairs of states), this is closely connected to (classical or quantum) Rényi divergences (RD) and the data-processing inequality: If a RD remains unchanged when a channel is applied to the dichotomy, then there is a recovery channel mapping the image back to the initial dichotomy. Here, we prove for classical dichotomies that equality of the RDs alone is already sufficient for the existence of a channel in any of the two directions and discuss some applications. In the quantum case, all families of quantum RDs are seen to be insufficient because they cannot detect anti-unitary transformations. Thus, including anti-unitaries, we pose the problem of finding a sufficient family. It is shown that the Petz and maximal quantum RD are still insufficient in this more general sense and we provide evidence for sufficiency of the minimal quantum RD. As a side result of our techniques, we obtain an infinite list of inequalities fulfilled by the classical, the Petz quantum, and the maximal quantum RDs. These inequalities are not true for the minimal quantum RDs. Our results further imply that any sufficient set of conditions for state transitions in the resource theory of athermality must be able to detect time-reversal.
The Bayesian inverse of a quantum channel
E is a channel
F in the reverse direction of
E that yields time-symmetric correlations for sequential measurements performed on open quantum systems. Such an operational form of time-reversal symmetry for open quantum systems is quite remarkable, as the dynamics of open quantum systems are inherently irreversible due to system-environment interactions. Similar to the Petz map, a Bayesian inverse
F is defined with respect to a fiducial reference state
ρ for the channel
E. However, Bayesian inverses do not always exist, and it is often a non-trivial task to determine the set of states
ρ for which a Bayesian inverse of
E exists. In this work, we solve the general problem of quantum Bayesian inversion for unital channels acting on a single qubit. Our analysis is streamlined by demonstrating that finding a Bayesian inverse for a unital qubit channel may be reduced to finding a Bayesian inverse of a Pauli channel, which is simply a mixture of unitary channels associated with the Pauli matrices. As such, we provide a complete description of when operational time-reversal symmetry is attainable for sequential measurements of a single qubit in the presence of unital noise.