Daniel Reitzner

Notes on Joint Measurability of Quantum Observables

For sharp quantum observables the following facts hold: (i) if we have a collection of sharp observables and each pair of them is jointly measurable, then they are jointly measurable all together; (ii) if two sharp observables are jointly measurable, then their joint observable is unique and it gives the greatest lower bound for the effects corresponding to the observables; (iii) if we have two sharp observables and their every possible two outcome partitionings are jointly measurable, then the observables themselves are jointly measurable. We show that, in general, these properties do not hold. Also some possible candidates which would accompany joint measurability and generalize these apparently useful properties are discussed.

Quantum searches on highly symmetric graphs

We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of the vertices have the same scattering properties except for a subset of special vertices. The object of the search is to find a special vertex. A quantum circuit implementation of these walks is presented in which the set of special vertices is specified by a quantum oracle. We consider the complete graph, a complete bipartite graph, and an M-partite graph. In all cases, the dimension of the Hilbert space in which the time evolution of the walk takes place is small (between three and six), so the walks can be completely analyzed analytically. Such dimensional reduction is due to the fact that these graphs have large automorphism groups. We find the usual quadratic quantum speedups in all cases considered.

Coexistence of qubit effects

We characterize all coexistent pairs of qubit effects. This gives an exhaustive description of all pairs of events allowed, in principle, to occur in a single qubit measurement. The char- acterization consists of three disjoint conditions which are easy to check for a given pair of effects. Known special cases are shown to follow from our general characterization theorem.

Searching via walking: How to find a marked subgraph of a graph using quantum walks

We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how to implement the quantum walk using a quantum circuit and a quantum oracle, which allows us to specify the resources needed for a quantitative comparison of the efficiency of classical and quantum searches--the number of oracle calls.

Coexistence does not imply joint measurability

One of the hallmarks of quantum theory is the realization that distinct measurements cannot in general be performed simultaneously, in stark contrast to classical physics. In this context the notions of coexistence and joint measurability are employed to analyze the possibility of measuring together two general quantum observables, characterizing different degrees of compatibility between measurements. It is known that two jointly measurable observables are always coexistent, and that the converse holds for various classes of observables, including the case of observables with two outcomes. Here we resolve, in the negative, the open question of whether this equivalence holds in general. Our resolution strengthens the notions of coexistence and joint measurability by showing that both are robust against small imperfections in the measurement setups.

Strongly Incompatible Quantum Devices

The fact that there are quantum observables without a simultaneous measurement is one of the fundamental characteristics of quantum mechanics. In this work we expand the concept of joint measurability to all kinds of possible measurement devices, and we call this relation compatibility. Two devices are incompatible if they cannot be implemented as parts of a single measurement setup. We introduce also a more stringent notion of incompatibility, strong incompatibility. Both incompatibility and strong incompatibility are rigorously characterized and their difference is demonstrated by examples.

Incompatibility breaking quantum channels

A typical bipartite quantum protocol, such as EPR-steering, relies on two quantum features, entanglement of states and incompatibility of measurements. Noise can delete both of these quantum features. In this work we study the behavior of incompatibility under noisy quantum channels. The starting point for our investigation is the observation that compatible measurements cannot become incompatible by the action of any channel. We focus our attention to channels which completely destroy the incompatibility of various relevant sets of measurements. We call such channels incompatibility breaking, in analogy to the concept of entanglement breaking channels. This notion is relevant especially for the understanding of noise-robustness of the local measurement resources for steering.

Quantum walks as a probe of structural anomalies in graphs

We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external vertices, are connected by edges. In the basic star graph, these are the only edges. If we now connect a subset of the external vertices to form a complete subgraph, a quantum walk can be used to find these vertices with a quantum speedup. Thus, under some circumstances, a quantum walk can be used to locate where the connectivity of a network changes. We also look at the case of two stars connected at one of their external vertices. A quantum walk can find the vertex shared by both graphs, again with a quantum speedup. This provides an example of using a quantum walk in order to find where two networks are connected. Finally, we use a quantum walk on a complete bipartite graph to find an extra edge that destroys the bipartite nature of the graph.

COEXISTENCE OF QUANTUM OPERATIONS

Quantum operations are used to describe the observed probability distributions and conditional states of the measured system. In this paper, we address the problem of their joint mea- surability (coexistence). We derive two equivalent coexistence cri- teria. The two most common classes of operations — Luders opera- tions and conditional state preparators — are analyzed. It is shown that Luders operations are coexistent only under very restrictive conditions, when the associated effects are either proportional to each other, or disjoint.

Incompatible measurements on quantum causal networks

The existence of incompatible measurements, epitomized by Heisenbergs uncertainty principle, is one of the distinctive features of quantum theory. So far, quantum incompatibility has been studied for measurements that test the preparation of physical systems. Here we extend the notion to measurements that test dynamical processes, possibly consisting of multiple time steps. Such measurements are known as testers and are implemented by interacting with the tested process through a sequence of state preparations, interactions, and measurements. Our first result is a characterization of the incompatibility of quantum testers, for which we provide necessary and sufficient conditions. Then we propose a quantitative measure of incompatibility. We call this measure the robustness of incompatibility and define it as the minimum amount of noise that has to be added to a set of testers in order to make them compatible. We show that (i) the robustness is lower bounded by the distinguishability of the sequence of interactions used by the tester and (ii) maximum robustness is attained when the interactions are perfectly distinguishable. The general results are illustrated in the concrete example of binary testers probing the time evolution of a single-photon polarization.