Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Edgar Feldman"'
Publikováno v:
Physical Review Letters. 116
We solve the long-standing problem of making n perfect clones from m copies of one of two known pure states with minimum failure probability in the general case where the known states have arbitrary a priori probabilities. The solution emerges from a
Autor:
Edgar Feldman, Mark Hillery
Publikováno v:
Journal of Physics A: Mathematical and Theoretical. 40:11343-11359
We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering theory. The pro
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure states in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75f076a6604d2c3fb9c6a3cd956ddfa0
We discuss sequential unambiguous state-discrimination measurements performed on the same qubit. Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, who also measures it. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45f073ac868c530956286c007fdf8346
Publikováno v:
Proceedings of the London Mathematical Society. :215-240
Publikováno v:
Physical Review Letters. 108
A complete geometric view is presented for the optimal unambiguous discrimination among N > 2 pure states. A single intuitive picture contains all aspects of the problem: linear independence of the states, positivity of the detection operators, and a
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 co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbe51000ebfb5dd14fd06651229284f4
We explore the possibility of using quantum walks on graphs to find structural anomalies, such as extra edges or loops, on a graph. We focus our attention on star graphs, whose edges are like spokes coming out of a central hub. If there are $N$ spoke
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c682bcc1d62ad61e0ea68384cc9c4123
Publikováno v:
Physical Review A. 79
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 vertic
Isoperimetric Constants, the Geometry of Ends, and Large Time Heat Diffusion in Riemannian Manifolds
Autor:
Edgar Feldman, Isaac Chavel
Publikováno v:
Proceedings of the London Mathematical Society. :427-448