Searcharxiv⌕ Search

arXiv subjects

Daniel Reitzner

Publications and source records attributed to Daniel Reitzner.

25 records · Page 2Linked to original sources
arXiv2009

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 resource needed for a quantitative comparison of the efficiency of classical and quantum searches -- the number of oracle calls.

quant-ph↗
arXiv2009

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 measurability (coexistence). We derive two equivalent coexistence criteria. The two most common classes of operations - Luders operations 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.

quant-ph↗
arXiv2009

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.

quant-ph↗
arXiv2008

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.

quant-ph↗
arXiv2008

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 characterization 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.

quant-ph↗
arXiv2007

Comment on Afshar's expriments

Results of the experiments carried out in [Shahriar S. Afshar, Proc. SPIE bf 5866 (2005) 229-244] and [Shahriar S. Afshar, AIP Cof. Proc. 810, (2006) 294-299] are reviewed and their interpretation by the authors is questioned. Arguments are supported by numerical simulations.

quant-ph↗