Ognyan Oreshkov

Weak Measurements Are Universal

It is well known that any projective measurement can be decomposed into a sequence of weak measurements, which cause only small changes to the state. Similar constructions for generalized measurements, however, have relied on the use of an ancilla system. We show that any generalized measurement can be decomposed into a sequence of weak measurements without the use of an ancilla, and give an explicit construction for these weak measurements. The measurement procedure has the structure of a random walk along a curve in state space, with the measurement ending when one of the end points is reached. This shows that any measurement can be generated by weak measurements, and hence that weak measurements are universal. This may have important applications to the theory of entanglement.

Causal and causally separable processes

The idea that events are equipped with a partial causal order is central to our understanding of physics in the tested regimes: given two pointlike events A and B, either A is in the causal past of B, B is in the causal past of A, or A and B are space-like separated. Operationally, the meaning of these order relations corresponds to constraints on the possible correlations between experiments performed in the vicinities of the respective events: if A is in the causal past of B, an experimenter at A could signal to an experimenter at B but not the other way around, while if A and B are space-like separated, no signaling is possible in either direction. In the context of a concrete physical theory, the correlations compatible with a given causal configuration may obey further constraints. For instance, space-like correlations in quantum mechanics arise from local measurements on joint quantum states, while time-like correlations are established via quantum channels. Similarly to other variables, however, the causal order of a set of events could be random, and little is understood about the constraints that causality implies in this case. A main difficulty concerns the fact that the order of events can now generally depend on the operations performed at the locations of these events, since, for instance, an operation at A could influence the order in which B and C occur in As future. So far, no formal theory of causality compatible with such dynamical causal order has been developed. Apart from being of fundamental interest in the context of inferring causal relations, such a theory is imperative for understanding recent suggestions that the causal order of events in quantum mechanics can be indefinite. Here, we develop such a theory in the general multipartite case. Starting from a background-independent definition of causality, we derive an iteratively formulated canonical decomposition of multipartite causal correlations. For a fixed number of settings and outcomes for each party, these correlations form a polytope whose facets define causal inequalities. The case of quantum correlations in this paradigm is captured by the process matrix formalism. We investigate the link between causality and the closely related notion of causal separability of quantum processes, which we here define rigorously in analogy with the link between Bell locality and separability of quantum states. We show that causality and causal separability are not equivalent in general by giving an example of a physically admissible tripartite quantum process that is causal but not causally separable. We also show that there are causally separable quantum processes that become non-causal if extended by supplying the parties with entangled ancillas. This motivates the concepts of extensibly causal and extensibly causally separable (ECS) processes, for which the respective property remains invariant under extension. We characterize the class of ECS quantum processes in the tripartite case via simple conditions on the form of the process matrix. We show that the processes realizable by classically controlled quantum circuits are ECS and conjecture that the reverse also holds.

Fault-tolerant holonomic quantum computation.

We explain how to combine holonomic quantum computation (HQC) with fault-tolerant quantum error correction. This establishes the scalability of HQC, putting it on equal footing with other models of computation, while retaining the inherent robustness the method derives from its geometric nature.

General conditions for approximate quantum error correction and near-optimal recovery channels.

We derive necessary and sufficient conditions for the approximate correctability of a quantum code, generalizing the Knill-Laflamme conditions for exact error correction. Our measure of success of the recovery operation is the worst-case entanglement fidelity. We show that the optimal recovery fidelity can be predicted exactly from a dual optimization problem on the environment causing the noise. We use this result to obtain an estimate of the optimal recovery fidelity as well as a way of constructing a class of near-optimal recovery channels that work within twice the minimal error. In addition to standard subspace codes, our results hold for subsystem codes and hybrid quantum-classical codes.

Non-Markovian dynamics of a qubit coupled to an Ising spin bath,

We study the analytically solvable Ising model of a single qubit system coupled to a spin bath. The purpose of this study is to analyze and elucidate the performance of Markovian and non-Markovian master equations describing the dynamics of the system qubit, in comparison to the exact solution. We find that the time-convolutionless master equation performs particularly well up to fourth order in the system-bath coupling constant, in comparison to the Nakajima-Zwanzig master equation. Markovian approaches fare poorly due to the infinite bath correlation time in this model. A recently proposed post-Markovian master equation performs comparably to the time-convolutionless master equation for a properly chosen memory kernel, and outperforms all the approximation methods considered here at long times. Our findings shed light on the applicability of master equations to the description of reduced system dynamics in the presence of spin baths.

Optimal signal states for quantum detectors

Quantum detectors provide information about the microscopic properties of quantum systems by establishing correlations between those properties and a set of macroscopically distinct events that we observe. The question of how much information a quantum detector can extract from a system is therefore of fundamental significance. In this paper, we address this question within a precise framework: given a measurement apparatus implementing a specific POVM measurement, what is the optimal performance achievable with it for a specific information readout task and what is the optimal way to encode information in the quantum system in order to achieve this performance? We consider some of the most common information transmission tasks—the Bayes cost problem, unambiguous message discrimination and the maximal mutual information. We provide general solutions to the Bayesian and unambiguous discrimination problems. We also show that the maximal mutual information is equal to the classical capacity of the quantum-to-classical channel describing the measurement, and study its properties in certain special cases. For a group covariant measurement, we show that the problem is equivalent to the problem of accessible information of a group covariant ensemble of states. We give analytical proofs of optimality in some relevant cases. The framework presented here provides a natural way to characterize generalized quantum measurements in terms of their information readout capabilities.

Operational quantum theory without predefined time

The standard formulation of quantum theory assumes a predefined notion of time. This is a major obstacle in the search for a quantum theory of gravity, where the causal structure of space-time is expected to be dynamical and fundamentally probabilistic in character. Here, we propose a generalized formulation of quantum theory without predefined time or causal structure, building upon a recently introduced operationally time-symmetric approach to quantum theory. The key idea is a novel isomorphism between transformations and states which depends on the symmetry transformation of time reversal. This allows us to express the time-symmetric formulation in a time-neutral form with a clear physical interpretation, and ultimately drop the assumption of time. In the resultant generalized formulation, operations are associated with regions that can be connected in networks with no directionality assumed for the connections, generalizing the standard circuit framework and the process matrix framework for operations without global causal order. The possible events in a given region are described by positive semidefinite operators on a Hilbert space at the boundary, while the connections between regions are described by entangled states that encode a nontrivial symmetry and could be tested in principle. We discuss how the causal structure of space-time could be understood as emergent from properties of the operators on the boundaries of compact space-time regions. The framework is compatible with indefinite causal order, timelike loops, and other acausal structures.

Encoding one logical qubit into six physical qubits

We discuss two methods to encode one qubit into six physical qubits. Each of our two examples corrects an arbitrary single-qubit error. Our first example is a degenerate six-qubit quantum error-correcting code. We explicitly provide the stabilizer generators, encoding circuit, codewords, logical Pauli operators, and logical controlled NOT operator for this code. We also show how to convert this code into a nontrivial subsystem code that saturates the subsystem Singleton bound. We then prove that a six-qubit code without entanglement assistance cannot simultaneously possess a Calderbank-Shor-Steane CSS stabilizer and correct an arbitrary single-qubit error. A corollary of this result is that the Steane seven-qubit code is the smallest single-error correcting CSS code. Our second example is the construction of a nondegenerate six-qubit CSS entanglementassisted code. This code uses one bit of entanglement an ebit shared between the sender and the receiver and corrects an arbitrary single-qubit error. The code we obtain is globally equivalent to the Steane seven-qubit code and thus corrects an arbitrary error on the receiver’s half of the ebit as well. We prove that this code is the smallest code with a CSS structure that uses only one ebit and corrects an arbitrary single-qubit error on the sender’s side. We discuss the advantages and disadvantages for each of the two codes.

Adiabatic markovian dynamics.

We propose a theory of adiabaticity in quantum markovian dynamics based on a decomposition of the Hilbert space induced by the asymptotic behavior of the Lindblad semigroup. A central idea of our approach is that the natural generalization of the concept of eigenspace of the Hamiltonian in the case of markovian dynamics is a noiseless subsystem with a minimal noisy cofactor. Unlike previous attempts to define adiabaticity for open systems, our approach deals exclusively with physical entities and provides a simple, intuitive picture at the Hilbert-space level, linking the notion of adiabaticity to the theory of noiseless subsystems. As two applications of our theory, we propose a general framework for decoherence-assisted computation in noiseless codes and a dissipation-driven approach to holonomic computation based on adiabatic dragging of subsystems that is generally not achievable by nondissipative means.

Distinguishability measures between ensembles of quantum states

A quantum ensemble