Related papers: Quantum embedding of graphs for subgraph counting
Entangled graph states can be used for quantum sensing and computing applications. Error correction in measurement-based quantum computing schemes will require the construction of cluster states in at least 3 dimensions. Here we generate…
We analyze a new scheme for quantum information processing, with superconducting charge qubits coupled through a cavity mode, in which quantum manipulations are insensitive to the state of the cavity. We illustrate how to physically…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
Quantum theory has shown its superiority in enhancing machine learning. However, facilitating quantum theory to enhance graph learning is in its infancy. This survey investigates the current advances in quantum graph learning (QGL) from…
With the rapid growth of interconnected devices, accurately detecting malicious activities in network traffic has become increasingly challenging. Most existing deep learning-based intrusion detection systems treat network flows as…
Graph-theoretic structures play a central role in the description and analysis of quantum systems. In this work, we introduce a new class of quantum states, called $A_\alpha$-graph states, which are constructed from either unweighted or…
Quantum networks illustrate the use of connected nodes of quantum systems as the backbone of distributed quantum information processing. When the network nodes are entangled in graph states, such a quantum platform is indispensable to…
When two or more subsystems of a quantum system interact with each other they can become entangled. In this case the individual subsystems can no longer be described as pure quantum states. For systems with only 2 subsystems this…
We introduce Quantum Graph Attention Networks (QGATs) as trainable quantum encoders for inductive learning on graphs, extending the Quantum Graph Neural Networks (QGNN) framework. QGATs leverage parameterized quantum circuits to encode node…
Recently, D. Gottesman et al. [Phys. Rev. A 64, 012310 (2001)] showed how to encode a qubit into a continuous variable quantum system. This encoding was realized by using non-normalizable quantum codewords, which therefore can only be…
We study the classic problem of subgraph counting, where we wish to determine the number of occurrences of a fixed pattern graph $H$ in an input graph $G$ of $n$ vertices. Our focus is on bounded degeneracy inputs, a rich family of graph…
Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum…
Non-destructive heralded entanglement with photons is a valuable resource for quantum information processing. However, they generally entail ancillary particles and modes that amplify the circuit intricacy. To address this challenge, a…
We construct a bosonic quantum field on a general quantum graph. Consistency of the construction leads to the calculation of the total scattering matrix of the graph. This matrix is equivalent to the one already proposed using generalized…
Many protocols of quantum information processing, like quantum key distribution or measurement-based quantum computation, "consume" entangled quantum states during their execution. When participants are located at distant sites, these…
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes,…
Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
We give a quantum algorithm for a novel type of black-box problem: identifying a hidden $d$-regular base graph $G$ on $n$ vertices from oracle access to an obfuscated version of it, rather than traversing it. From $G$ we build the spired…
We analyze few-body quantum states with particular correlation properties imposed by the requirement of maximal bipartite entanglement for selected partitions of the system into two complementary parts. A novel framework to treat this…