• No se han encontrado resultados

Quantum walk based algorithm on scale free networks

N/A
N/A
Protected

Academic year: 2020

Share "Quantum walk based algorithm on scale free networks"

Copied!
132
0
0

Texto completo

Loading

Figure

Figure 2.5: Generation of the double cover bipartite graph from an irregular graph of N = 4 vertices.
Figure 2.7: Graph for C 7
Figure 5.10: Yorktown quantum processor.
Figure 6.2: A directed graph The connectivity matrix given by:
+7

Referencias

Documento similar

This supports the view that the acceleration radiation is robust against Planck scale physics and suggests that any theory of quantum gravity, with new microscopic degrees of

However it is fair to say that the study of entanglement close to a quantum critical point does not provide new understanding to the scaling theory of quantum phase transitions

In this way, the quantization of the Kuramoto model is straightforward and includes its classical counterpart as a limiting case: The quantum version incorporates quantum

6 we discuss the interacting theory, outline the extension to quantum field theory, and discuss the issue of giving a sensible interpretation to negative norms, via a pos- tulate

Here we present the theoretical foundation of the strong coupling phenomenon between quantum emitters and propagating surface plasmons observed in two-dimensional metal surfaces..

These algebras naturally appear as a residual gauge symmetry in the theory of relativistic membranes [3], which exhibits an intriguing connection with the quantum mechanics of

In working on a group, the problem of first and second canonical quantization on a (symmetric) curved space (which, relies heavily on both the structure of space-time itself and

In this paper, inspired by the analysis carried in [22–24], we exploit the holographic structure of the Multiscale Entanglement Renormalization Ansatz (MERA) tensor net- works,