Related papers: Google In A Photonic Lattice
We describe a new method of reduced Google matrix which allows to establish direct and hidden links between a subset of nodes of a large directed network. This approach uses parallels with quantum scattering theory, developed for processes…
Continuous-time quantum walks provide an alternative method for quantum search problems. Most of the earlier studies confirmed that quadratic speedup exists in some synthetic Hamiltonians, but whether there is quadratic speedup in real…
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise…
The well-known statistic PageRank was created in 1998 by co-founders of Google, Sergey Brin and Larry Page, to optimize the ranking of websites for their search engine outcomes. It is computed using an iterative algorithm, based on the idea…
Quantum algorithms for electronic-structure simulations are actively being developed, yet many hybrid quantum-classical approaches are bottlenecked by the measurement overhead associated with large molecular Hamiltonians. Here we introduce…
We address quantum spatial search on graphs and its implementation by continuous-time quantum walks in the presence of dynamical noise. In particular, we focus on search on the complete graph and on the star graph of order $N$, proving that…
A new, "quantum mechanical" algorithm is proposed for automatic photopeak location in gamma-ray spectra from semiconductor and scintillator detectors.
Fast computational algorithms are in constant demand, and their development has been driven by advances such as quantum speedup and classical acceleration. This paper intends to study search algorithms based on quantum walks in quantum…
The simulation of dense fermionic matters is a long-standing problem in lattice gauge theory. One hopeful solution would be the use of quantum computers. In this paper, digital quantum simulation is designed for lattice gauge theory at…
By pursuing the deep relation between the one-dimensional Dirac equation and quantum walks, the physical role of quantum interference in the latter is explained. It is shown that the time evolution of the probability density of a quantum…
A formalism is presented in which quantum particle dynamics can be developed on its own rather than `quantization' of an underlying classical theory. It is proposed that the unification of probability and dynamics should be considered as…
Quantum computing has brought a paradigm change in computer science, where non-classical technologies have promised to outperform their classical counterpart. Such an advantage was only demonstrated for tasks without practical applications,…
Integrated photonics is at the heart of many classical technologies, from optical communications to biosensors, LIDAR, and data center fiber interconnects. There is strong evidence that these integrated technologies will play a key role in…
Quantum machine learning aims to release the prowess of quantum computing to improve machine learning methods. By combining quantum computing methods with classical neural network techniques we aim to foster an increase of performance in…
This work proposes a computational procedure that uses a quantum walk in a complete graph to train classical artificial neural networks. The idea is to apply the quantum walk to search the weight set values. However, it is necessary to…
In this paper, we propose and study a master-equation based approach to drive a quantum network with $n$ qubits to a consensus (symmetric) state introduced by Mazzarella et al. The state evolution of the quantum network is described by a…
Quantum computing provides a novel avenue towards simulating dynamical phenomena, and, in particular, scattering processes relevant for exploring the structure of matter. However, preparing and evolving particle wave packets on a quantum…
In this work we give a comprehensive derivation of an exact and numerically feasible method to perform ab-initio calculations of quantum particles interacting with a quantized electromagnetic field. We present a hierachy of…
In the traditional random-conformational-search model, various hypotheses with a series of meta-stable intermediate states were often proposed to resolve the Levinthal paradox. Here we introduce a quantum strategy to formulate protein…
In this work we show that the simple Hamiltonians used in Quantum Graphity models are highly degenerate, having multiple ground states that are not lattices. In order to assess the distance of the resulting graphs from a lattice graph, we…