Related papers: Reaching a Quantum Consensus: Master Equations tha…
Semantic knowledge graphs are large-scale triple-oriented databases for knowledge representation and reasoning. Implicit knowledge can be inferred by modeling and reconstructing the tensor representations generated from knowledge graphs.…
From a quantum information perspective, verifying quantum coherence in a quantum experiment typically requires adjusting measurement settings or changing inputs. A paradigmatic example is that of a double-slit experiment, where observing…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
In this article we further investigate the construction of graph coherent states, first introduced in [1], in the context of loop quantum gravity. We specifically investigate the possibility of defining a family of graph coherent states…
The classification of big data usually requires a mapping onto new data clusters which can then be processed by machine learning algorithms by means of more efficient and feasible linear separators. Recently, Lloyd et al. have advanced the…
In the framework of the Lindblad theory for open quantum systems we determine the degree of quantum decoherence and classical correlations of a harmonic oscillator interacting with a thermal bath. The transition from quantum to classical…
It is believed that the theory of quantum gravity describing our universe is unitary. Nonetheless, if we only have access to a subsystem, its dynamics is described by nonequilibrium physics. Motivated by this, we investigate the planar…
Quantum decoherence provides a framework to study the emergence of classicality from quantum systems by showing how interactions with the environment suppress interferences and select robust states known as pointer states. Earlier studies…
Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical…
Over the past few decades, significant progress has been made in quantum information technology, from theoretical studies to experimental demonstrations. Revolutionary quantum applications are now in the limelight, showcasing the advantages…
Recent work has exposed the idea that interesting quantum-like probability laws, including interference effects, can be manifest in classical systems. Here we propose a model for quantum-like (QL) states and QL bits. We suggest a way that…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
We study the Markovian dynamics of a collection of n quantum systems coupled to an irreversible environmental channel consisting of a stream of n entangled qubits. Within the framework of repeated quantum interactions, we derive the master…
In this paper we present a novel approach to emulating a universal quantum computer with a classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality…
We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary…
Conventional quantum trajectory theory developed in quantum optics is largely based on the physical unravelling of Lindbald-type master equation, which constitutes the theoretical basis of continuous quantum measurement and feedback…
Measurement-Based Quantum Networks (MBQNs) rely on multipartite pre-shared entanglement resources to satisfy entanglement requests. Traditional designs optimize these resources for individual tasks, neglecting that multiple tasks may arrive…
Irreversibility is introduced to quantum graphs by coupling the graphs to a bath of harmonic oscillators. The interaction which is linear in the harmonic oscillator amplitudes is localized at the vertices. It is shown that for sufficiently…
The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum…
The practical utility of a quantum network depends on its ability to establish entanglement between arbitrary node pairs with quality sufficient to execute entanglement enabled tasks. This capability can be assessed globally, through…