Browse
Submit Data
Databases
API
Help

Dataset Information

26 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Quantum walk coherences on a dynamical percolation graph.

ABSTRACT: Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In particular, quantum walks on percolation structures constitute an attractive platform for studying open system dynamics of random media. Here, we present an implementation of quantum walks differing from the previous experiments by achieving dynamical control of the underlying graph structure. We demonstrate the evolution of an optical time-multiplexed quantum walk over six double steps, revealing the intricate interplay between the internal and external degrees of freedom. The observation of clear non-Markovian signatures in the coin space testifies the high coherence of the implementation and the extraordinary degree of control of all system parameters. Our work is the proof-of-principle experiment of a quantum walk on a dynamical percolation graph, paving the way towards complex simulation of quantum transport in random media.

SUBMITTER: Elster F

PROVIDER: S-EPMC4550913 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Quantum percolation and transition point of a directed discrete-time quantum walk.

Project description:Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson localisation. Here, we consider a directed discrete-time quantum walk as a model to study quantum percolation of a two-state particle on a two-dimensional lattice. Using numerical analysis we determine the fraction of connected edges required (transition point) in the lattice for the two-state particle to percolate with finite (non-zero) probability for three fundamental lattice geometries, finite square lattice, honeycomb lattice, and nanotube structure and show that it tends towards unity for increasing lattice sizes. To support the numerical results we also use a continuum approximation to analytically derive the expression for the percolation probability for the case of the square lattice and show that it agrees with the numerically obtained results for the discrete case. Beyond the fundamental interest to understand the dynamics of a two-state particle on a lattice (network) with disconnected vertices, our study has the potential to shed light on the transport dynamics in various quantum condensed matter systems and the construction of quantum information processing and communication protocols.

| S-EPMC4192638 | biostudies-other

Multiple Quantum Coherences Hyperpolarized at Ultra-Low Fields.

Project description:The development of hyperpolarization technologies enabled several yet exotic NMR applications at low and ultra-low fields (ULF), where without hyperpolarization even the detection of a signal from analytes is a challenge. Herein, we present a method for the simultaneous excitation and observation of homo- and heteronuclear multiple quantum coherences (from zero up to the third-order), which give an additional degree of freedom for ULF NMR experiments, where the chemical shift variation is negligible. The approach is based on heteronuclear correlated spectroscopy (COSY); its combination with a phase-cycling scheme allows the selective observation of multiple quantum coherences of different orders. The nonequilibrium spin state and multiple spin orders are generated by signal amplification by reversible exchange (SABRE) and detected at ULF with a superconducting quantum interference device (SQUID)-based NMR system.

| S-EPMC6900040 | biostudies-literature

Quantum walk hydrodynamics.

Project description:A simple Discrete-Time Quantum Walk (DTQW) on the line is revisited and given an hydrodynamic interpretation through a novel relativistic generalization of the Madelung transform. Numerical results show that suitable initial conditions indeed produce hydrodynamical shocks and that the coherence achieved in current experiments is robust enough to simulate quantum hydrodynamical phenomena through DTQWs. An analytical computation of the asymptotic quantum shock structure is presented. The non-relativistic limit is explored in the Supplementary Material (SM).

| S-EPMC6393481 | biostudies-literature

Quantum walk processes in quantum devices.

Project description:Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic subroutine in many quantum algorithms and plays an important role in studying physical phenomena. Simulating quantum walk processes is computationally challenging for classical processors. With an increasing improvement in qubits fidelity and qubits number in a single register, there is a potential to improve quantum walks simulations substantially. However, efficient ways to simulate quantum walks in qubit registers still have to be explored. Here, we explore the relationship between quantum walk on graphs and quantum circuits. Firstly, we discuss ways to obtain graphs provided quantum circuit. We then explore techniques to represent quantum walk on a graph as a quantum circuit. Specifically, we study hypercube graphs and arbitrary graphs. Our approach to studying the relationship between graphs and quantum circuits paves way for the efficient implementation of quantum walks algorithms on quantum computers.

| S-EPMC9988498 | biostudies-literature

Percolation thresholds for photonic quantum computing.

Project description:Despite linear-optical fusion (Bell measurement) being probabilistic, photonic cluster states for universal quantum computation can be prepared without feed-forward by fusing small n-photon entangled clusters, if the success probability of each fusion attempt is above a threshold, [Formula: see text]. We prove a general bound [Formula: see text], and develop a conceptual method to construct long-range-connected clusters where [Formula: see text] becomes the bond percolation threshold of a logical graph. This mapping lets us find constructions that require lower fusion success probabilities than currently known, and settle a heretofore open question by showing that a universal cluster state can be created by fusing 3-photon clusters over a 2D lattice with a fusion success probability that is achievable with linear optics and single photons, making this attractive for integrated-photonic realizations.

| S-EPMC6403388 | biostudies-literature

Efficient quantum walk on a quantum processor.

Project description:The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.

| S-EPMC4858748 | biostudies-literature

Dynamical structure factors of dynamical quantum simulators.

Project description:The dynamical structure factor is one of the experimental quantities crucial in scrutinizing the validity of the microscopic description of strongly correlated systems. However, despite its long-standing importance, it is exceedingly difficult in generic cases to numerically calculate it, ensuring that the necessary approximations involved yield a correct result. Acknowledging this practical difficulty, we discuss in what way results on the hardness of classically tracking time evolution under local Hamiltonians are precisely inherited by dynamical structure factors and, hence, offer in the same way the potential computational capabilities that dynamical quantum simulators do: We argue that practically accessible variants of the dynamical structure factors are bounded-error quantum polynomial time ([Formula: see text])-hard for general local Hamiltonians. Complementing these conceptual insights, we improve upon a novel, readily available measurement setup allowing for the determination of the dynamical structure factor in different architectures, including arrays of ultra-cold atoms, trapped ions, Rydberg atoms, and superconducting qubits. Our results suggest that quantum simulations employing near-term noisy intermediate-scale quantum devices should allow for the observation of features of dynamical structure factors of correlated quantum matter in the presence of experimental imperfections, for larger system sizes than what is achievable by classical simulation.

| S-EPMC7585022 | biostudies-literature

Quantum-walk search in motion.

Project description:In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. However, when multiple marked nodes exist, the conventional search algorithm lacks the capacity to simultaneously amplify the marked nodes as well as identify the correct chronological ordering between the marked nodes, if any. To address this limitation, we explore a potential extension of the algorithm by introducing additional quantum states to label the marked nodes. The labels resolve the ambiguity of simultaneous amplification of the marked nodes. Additionally, by associating the label states with a chronological ordering, we can extend the algorithm to track a moving particle on a two-dimensional surface. Our algorithm efficiently searches for the trajectory of the particle and is supported by a proposed quantum circuit. This concept holds promise for a range of applications, from real-time object tracking to network management and routing.

| S-EPMC10837460 | biostudies-literature

Discrete-time quantum walk with feed-forward quantum coin.

Project description:Constructing a discrete model like a cellular automaton is a powerful method for understanding various dynamical systems. However, the relationship between the discrete model and its continuous analogue is, in general, nontrivial. As a quantum-mechanical cellular automaton, a discrete-time quantum walk is defined to include various quantum dynamical behavior. Here we generalize a discrete-time quantum walk on a line into the feed-forward quantum coin model, which depends on the coin state of the previous step. We show that our proposed model has an anomalous slow diffusion characterized by the porous-medium equation, while the conventional discrete-time quantum walk model shows ballistic transport.

| S-EPMC3961739 | biostudies-literature

Influence of Random Walk Parametrization on Graph Embeddings

Project description:Network or graph embedding has gained increasing attention in the research community during the last years. In particular, many methods to create graph embeddings using random walk based approaches have been developed. node2vec [10] introduced means to control the random walk behavior, guiding the walks. We aim to reproduce parts of their work and introduce two additional modifications (jump probabilities and attention to hubs), in order to investigate how guiding and modifying the walks influences the learned embeddings. The reproduction includes the case study illustrating homophily and structural equivalence subject to the chosen strategy and a node classification task. We were not able to illustrate structural equivalence and further results show that modifications of the walks only slightly improve node classification, if at all.

| S-EPMC7148094 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data