Related papers: Rooted-tree network for optimal non-local gate imp…
We show how to achieve perfect quantum state transfer and construct effective two-qubit gates between distant sites in engineered bosonic and fermionic networks. The Hamiltonian for the system can be determined by choosing an eigenvalue…
Arboreal networks are a generalization of rooted trees, defined by keeping the tree-like structure, but dropping the requirement for a single root. Just as the class of cographs is precisely the class of undirected graphs that can be…
Gate-based quantum computations represent an essential to realize near-term quantum computer architectures. A gate-model quantum neural network (QNN) is a QNN implemented on a gate-model quantum computer, realized via a set of unitaries…
A cut tree (or Gomory-Hu tree) of an undirected weighted graph G=(V,E) encodes a minimum s-t-cut for each vertex pair {s,t} \subseteq V and can be iteratively constructed by n-1 maximum flow computations. They solve the multiterminal…
Certain quantum gates, such as the controlled-NOT gate, are symmetric in terms of the operation of the control system upon the target system and vice versa. However, no operational criteria yet exist for establishing whether or not a given…
Peer to peer network architecture introduces many desired features including self-scalability that led to achieving higher efficiency rate than the traditional server-client architecture. This was contributed to the highly distributed…
We show how to construct a multi-qubit control gate on a quantum register of an arbitrary size N. This gate performs a single-qubit operation on a specific qubit conditioned by the state of other N-1 qubits. We provide an algorithm how to…
The goal in quantum state transfer is to avoid the need to physically transport carriers of quantum information. This is achieved by using a suitably engineered Hamiltonian that induces the transfer of the state of one subsystem to another.…
Quantum communication research has in recent years shifted to include multi-partite networks for which questions of quantum network routing naturally emerge. To understand the potential for multi-partite routing, we focus on the most…
A tree tensor network variational method is proposed to simulate quantum many-body systems with global symmetries where the optimization is reduced to individual charge configurations. A computational scheme is presented, how to extract the…
In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this…
We present a stack model for breaking down the complexity of entanglement-based quantum networks. More specifically, we focus on the structures and architectures of quantum networks and not on concrete physical implementations of network…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
Probabilistic graphical models such as Bayesian networks are widely used to model stochastic systems to perform various types of analysis such as probabilistic prediction, risk analysis, and system health monitoring, which can become…
The quantum internet is a rapidly developing technological reality, yet, it remains unclear what kind of quantum network structures might emerge. Since indirect quantum communication is already feasible and preserves absolute security of…
Trees are fundamental data structure for many areas of computer science and system engineering. In this report, we show how to ensure eventual consistency of optimistically replicated trees. In optimistic replication, the different replicas…
We investigate the structural organization of the point-to-point electric, diffusive or hydraulic transport in complex scale-free networks. The random choice of two nodes, a source and a drain, to which a potential difference is applied,…
We investigate the minimal resources that are required in the local implementation of non-local quantum gates in a distributed quantum computer. Both classical communication requirements and entanglement consumption are investigated. We…
A quantum network shared entangled sources among distant nodes enables us to distribute entanglement along the network by suitable measurements. Network nonlocality means that it does not admit a network model involving local variables…
CNOT circuits are a common building block of general quantum circuits. The problem of synthesizing and optimizing such circuits has received a lot of attention in the quantum computing literature. This problem is especially challenging for…