Entanglement in many-body systems

L Amico, R Fazio, A Osterloh, V Vedral - Reviews of modern physics, 2008 - APS
Recent interest in aspects common to quantum information and condensed matter has
prompted a flurry of activity at the border of these disciplines that were far distant until a few …

Quantum entanglement in condensed matter systems

N Laflorencie - Physics Reports, 2016 - Elsevier
This review focuses on the field of quantum entanglement applied to condensed matter
physics systems with strong correlations, a domain which has rapidly grown over the last …

[BOOK][B] The Jaynes–Cummings model and its descendants: modern research directions

J Larson, T Mavrogordatos - 2021 - iopscience.iop.org
The Jaynes–Cummings Model (JCM) has recently been receiving increased attention as
one of the simplest, yet intricately nonlinear, models of quantum physics. Emphasising the …

Quantum walk and its application domains: A systematic review

K Kadian, S Garhwal, A Kumar - Computer Science Review, 2021 - Elsevier
Quantum random walk is the quantum counterpart of a classical random walk. The classical
random walk concept has long been used as a computational framework for designing …

Environment-assisted quantum walks in photosynthetic energy transfer

M Mohseni, P Rebentrost, S Lloyd… - The Journal of chemical …, 2008 - pubs.aip.org
Energy transfer within photosynthetic systems can display quantum effects such as
delocalized excitonic transport. Recently, direct evidence of long-lived coherence has been …

[BOOK][B] Quantum walks and search algorithms

R Portugal - 2013 - Springer
This is a textbook about quantum walks and quantum search algorithms. The readers will
take advantage of the pedagogical aspects and learn the topics faster and make less effort …

mixers: Analytical and numerical results for the quantum alternating operator ansatz

Z Wang, NC Rubin, JM Dominy, EG Rieffel - Physical Review A, 2020 - APS
The quantum alternating operator ansatz (QAOA) is a promising gate-model metaheuristic
for combinatorial optimization. Applying the algorithm to problems with constraints presents …

Universal quantum computation using the discrete-time quantum walk

NB Lovett, S Cooper, M Everitt, M Trevers… - Physical Review A …, 2010 - APS
A proof that continuous-time quantum walks are universal for quantum computation, using
unweighted graphs of low degree, has recently been presented by AM Childs [Phys. Rev …

Exponential improvement in precision for simulating sparse Hamiltonians

DW Berry, AM Childs, R Cleve, R Kothari… - Proceedings of the forty …, 2014 - dl.acm.org
We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with
complexity sublogarithmic in the inverse error, an exponential improvement over previous …

Perfect transfer of arbitrary states in quantum spin networks

M Christandl, N Datta, TC Dorlas, A Ekert, A Kay… - Physical Review A …, 2005 - APS
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional
quantum state in a fixed period of time. We further show that such networks can distribute …