相关论文: Growth of graph states in quantum networks
Graph and hypergraph states are important resource states for realizing universal quantum computation and diverse non-local physical phenomena. However, noise learning in such states is challenging due to their large entanglement and magic.…
Quantum state transfer is a fundamental requirement for scalable quantum computation, where fast and reliable communication between distant subsystems is essential. In this work, we present a protocol for quantum state transfer in linear…
The quantum circuit model is the default for encoding an algorithm intended for a NISQ computer or a quantum computing simulator. A simple graph and through it, a graph state - quantum state physically manifesting an abstract graph…
Quantum information processing protocols are efficiently implemented on spin-$\frac{1}{2}$ networks. A quantum communication protocol generally involves a certain number of parties having local access to a subset of a larger system, whose…
Distributed quantum computing is motivated by the difficulty in building large-scale, individual quantum computers. To solve that problem, a large quantum circuit is partitioned and distributed to small quantum computers for execution.…
Highly entangled quantum states are an ingredient in numerous applications in quantum computing. However, preparing these highly entangled quantum states on currently available quantum computers at high fidelity is limited by ubiquitous…
High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…
We present an entanglement generation scheme which allows arbitrary graph states to be efficiently created in a linear quantum register via an auxiliary entangling bus. The dynamics of the entangling bus is described by an effective…
There has been a recent explosion in the size of stored data, partially due to advances in storage technology, and partially due to the growing popularity of cloud-computing and the vast quantities of data generated. This motivates the need…
A scalable quantum computer could be built by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that realistic quantum links are very error prone. A solution is…
Due to the massive size of modern network data, local algorithms that run in sublinear time for analyzing the cluster structure of the graph are receiving growing interest. Two typical examples are local graph clustering algorithms that…
Tremendous efforts have been paid for realization of fault-tolerant quantum computation so far. However, preexisting fault-tolerant schemes assume that a lot of qubits live together in a single quantum system, which is incompatible with…
The article introduces a new method for applying Quantum Clustering to graph structures. Quantum Clustering (QC) is a novel density-based unsupervised learning method that determines cluster centers by constructing a potential function. In…
Normalized-cut graph partitioning aims to divide the set of nodes in a graph into $k$ disjoint clusters to minimize the fraction of the total edges between any cluster and all other clusters. In this paper, we consider a fair variant of the…
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…
We are interested in multilayer graph clustering, which aims at dividing the graph nodes into categories or communities. To do so, we propose to learn a clustering-friendly embedding of the graph nodes by solving an optimization problem…
Distributed consensus algorithm over networks of quantum systems has been the focus of recent studies in the context of quantum computing and distributed control. Most of the progress in this category have been on the convergence conditions…
According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce a new algorithm for this task, which is based on the…
A stable population network is hard to interrupt without any ecological consequences. A communication blockage between patches may destabilize the populations in the ecological network. This work deals with the construction of a safe cut…
Statistical correlations that can be generated across the nodes in a quantum network depend crucially on its topology. However, this topological information might not be known a priori, or it may need to be verified. In this paper, we…