Related papers: Rooted-tree network for optimal non-local gate imp…
Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing. However, designing efficient parameterized quantum circuits remains a challenge. Quantum architecture search tackles this by…
Distributed quantum computing relies on coordinated operations between remote quantum processing units (QPUs), yet most existing work either assumes full connectivity, unrealistic for large networks, or relies on entanglement swapping. To…
It has been observed that mutualistic bipartite networks have a nested structure of interactions. In addition, the degree distributions associated with the two guilds involved in such networks (e.g. plants & pollinators or plants & seed…
A tree-based network $\mathcal N$ on $X$ is universal if every rooted binary phylogenetic $X$-tree is a base tree for $\mathcal N$. Hayamizu and, independently, Zhang constructively showed that, for all positive integers $n$, there exists…
Tree-based networks are a class of phylogenetic networks that attempt to formally capture what is meant by "tree-like" evolution. A given non-tree-based phylogenetic network, however, might appear to be very close to being tree-based, or…
No quantum circuit can turn a completely unknown unitary gate into its coherently controlled version. Yet, coherent control of unknown gates has been realised in experiments, making use of a different type of initial resources. Here, we…
We consider the task of secure multi-party distributed quantum computation on a quantum network. We propose a protocol based on quantum error correction which reduces the number of necessary qubits. That is, each of the $n$ nodes in our…
From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either…
This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
We suggest a simple method to engineer a tight-binding quantum network based on proper coupling to an auxiliary non-Hermitian cluster. In particular, it is shown that effective complex non-Hermitian hopping rates can be realized with only…
We consider a system of multiple qubits without any quantum control. We show that one can mediate entanglement between different subsystems in a controlled way by adding a (locally) controlled auxiliary system of the same size that couples…
The future Quantum Internet is expected to be based on a hybrid architecture with core quantum transport capabilities complemented by conventional networking.Practical and foundational considerations indicate the need for conventional…
In this paper is presented an abstract theory of quantum processors and controllers, special kind of quantum computational network defined on a composite quantum system with two parts: the controlling and controlled subsystems. Such…
We propose a novel one-way quantum repeater architecture based on photonic tree-cluster states. Encoding a qubit in a photonic tree-cluster protects the information from transmission loss and enables long-range quantum communication through…
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an…
It is required to find an optimal order of constructing the edges of a network so as to minimize the sum of the weighted connection times of relevant pairs of vertices. Construction can be performed anytime anywhere in the network, with a…
Genuine multipartite nonlocality is a salient feature of quantum systems, empowering the security of multi-party device independent cryptographic protocols. Given a correlation, characterizing and detecting genuineness have been subjected…
This paper studies algorithms for computing a Gomory-Hu tree, which is a classical data structure that compactly stores all minimum $s$-$t$ cuts of an undirected weighted graph. We consider two classes of algorithms: the original method by…
We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the preferential compactness mechanism have complex…