|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Quantum Walk-based Generation of Entanglement Between Two Walkers | | Salvador E. Venegas-Andraca
; Sougato Bose
; | | Date: |
26 Jan 2009 | | Abstract: | Quantum walks can be used either as tools for quantum algorithm development
or as entanglement generators, potentially useful to test quantum hardware. We
present a novel algorithm based on a discrete Hadamard quantum walk on a line
with one coin and two walkers whose purpose is to generate entanglement between
walkers. We provide several classical computer simulations of our quantum
algorithm in which we show that, although the asymptotical amount of
entanglement generated between walkers does not reach the highest degree of
entanglement possible at each step for either coin measurement outcome, the
entanglement ratio (entanglement generated/highest value of entanglement
possible, for each step) tends to converge, and the actual convergence value
depends on the coin initial state and on the coin measurement outcome.
Furthermore, our numerical simulations show that, for the quantum walks used in
our algorithm, the value towards which entanglement ratio converges also
depends on the position probability distribution symmetry of a quantum walk
computed with one single walker and the same coin initial state employed in the
corresponding quantum walk with two walkers. | | Source: | arXiv, 0901.3946 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER