Photonic discrete-time quantum walks [Invited]

Zhu, Gaoyan; Liu, Xiao; Huo, Bingzi; Xue, Peng

doi:10.3788/col202018.052701

Cited by 5 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If these degrees of freedom belong to the same particle, more information can be encoded at the single-particle level, which can help to reduce the required resources [24]. Photonic hybrid entangled states can be advantageous in optical quantum networks as it enables a more flexible network with each photon being transmitted through the more suited channel [25]. Photonic quantum information offers several technological applications [26].…”

Section: Introductionmentioning

confidence: 99%

“…Photonic quantum information offers several technological applications [26]. Photonic implementations of discrete-time quantum walk have been explored several times [25]. In this scenario, the preparation of maximally hybrid entangled states using DTQWs is of great importance, as it would give rise to new possibilities with regards to quantum technologies.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Generating highly entangled states via discrete-time quantum walks with Parrondo sequences

Govind¹,

Benjamin²

2020

Preprint

View full text Add to dashboard Cite

Quantum entanglement has multiple applications in quantum information processing. Methods to generate highly entangled states independent of initial conditions is an essential task. Herein we aim to generate highly entangled states via discrete time quantum walks. We propose deterministic Parrondo sequences that generate states that are, in general, much more entangled than states produced by sequences using only either one of the two coins. We show that some Parrondo sequences generate highly entangled states which are independent of the phase of the initial state used and further lead to maximally entangled states in some cases. We study Parrondo sequences for both small number of time steps as well as the asymptotic limit of a large number of time steps.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Generating highly entangled states via discrete-time quantum walks with Parrondo sequences

Govind¹,

Benjamin²

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Quantum walks harness the superposition and the entanglement of quantum systems, which lead to many applications in quantum information, including the development of quantum-enhanced algorithms [3][4][5][6], quantum simulations [7][8][9][10][11], and universal quantum computation [12,13]. Quantum walks have been realized in many physical systems, including photons [14][15][16][17][18][19][20][21][22][23][24][25][26] and atoms [27][28][29][30][31]. See the review in Ref.…”

mentioning

confidence: 99%

Experimental Parity-Time Symmetric Quantum Walks for Centrality Ranking on Directed Graphs

Izaac

et al. 2020

Phys. Rev. Lett.

View full text Add to dashboard Cite

Using quantum walks (QWs) to rank the centrality of nodes in networks, represented by graphs, is advantageous compared to certain widely used classical algorithms. However, it is challenging to implement a directed graph via QW, since it corresponds to a non-Hermitian Hamiltonian and thus cannot be accomplished by conventional QW. Here we report the realizations of centrality rankings of a three-, a four-, and a nine-vertex directed graph with parity-time (PT) symmetric quantum walks by using highdimensional photonic quantum states, multiple concatenated interferometers, and dimension dependent loss to achieve these. We demonstrate the advantage of the QW approach experimentally by breaking the vertex rank degeneracy in a four-vertex graph. Furthermore, we extend our experiment from single-photon to two-photon Fock states as inputs and realize the centrality ranking of a nine-vertex graph. Our work shows that a PT symmetric multiphoton quantum walk paves the way for realizing advanced algorithms.

show abstract

Generating highly entangled states via discrete-time quantum walks with Parrondo sequences

Govind

Benjamin²

2022

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

Photonic discrete-time quantum walks [Invited]

Cited by 5 publications

References 0 publications

Generating highly entangled states via discrete-time quantum walks with Parrondo sequences

Generating highly entangled states via discrete-time quantum walks with Parrondo sequences

Experimental Parity-Time Symmetric Quantum Walks for Centrality Ranking on Directed Graphs

Generating highly entangled states via discrete-time quantum walks with Parrondo sequences

Contact Info

Product

Resources

About