Related papers: Construction and Rigorous Analysis of Quantum-Like…
Entangled quantum networks provide great flexibilities and scalabilities for quantum information processing or quantum Internet. Most of results are focused on the nonlocalities of quantum networks. Our goal in this work is to explore new…
We study the entanglement properties of randomized mixed hypergraph states, extending the concept of randomized mixed graph states to encompass hypergraph-based quantum states. In our model, imperfect generalized multi-qubit gates are…
Quantum protocols often require the generation of specific quantum states. We describe a quantum algorithm for generating any prescribed quantum state. For an important subclass of states, including pure symmetric states, this algorithm is…
Higher-order networks with multiway interactions can exhibit collective dynamical phenomena that are absent in traditional pairwise network models. However, analyzing such dynamics becomes computationally prohibitive as their state space…
Graph states have been used to construct quantum error correction codes for independent errors. Hypergraph states generalize graph states, and symmetric hypergraph states have been shown to allow for the correction of correlated errors. In…
We propose an approach that enables to use it for construction of rotations of coherent states, in particular, it gives a possibility to construct Hadamard gate for the coherent states. Our approach is based on representation of arbitrary…
Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more frequent error types. The well-known CSS construction of $q$-ary AQCs is extended…
Critical to the construction of large scale quantum networks, i.e. a quantum internet, is the development of fast algorithms for managing entanglement present in the network. One fundamental building block for a quantum internet is the…
We develop a quantum topological data analysis (QTDA) protocol based on the estimation of the density of states (DOS) of the combinatorial Laplacian. Computing topological features of graphs and simplicial complexes is crucial for analyzing…
The construction of a perfectly secure private quantum channel in dimension d is known to require 2 log d shared random key bits between the sender and receiver. We show that if only near-perfect security is required, the size of the key…
A general method in constructing a complete set of wave functions for multipartite identical qubits is presented based on the irreducible representations of the permutation group and the nth rank tensors. Particular examples for n =2, 3,…
In this paper we explore the possibility of fundamental tests for coherent state optical quantum computing gates [T. C. Ralph, et. al, Phys. Rev. A \textbf{68}, 042319 (2003)] using sophisticated but not unrealistic quantum states. The…
We present an infinite number of construction schemes involving unitary error bases, Hadamard matrices, quantum Latin squares and controlled families, many of which have not previously been described. Our results rely on biunitary…
We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
We introduce an elementary quantum system consisting of a set of spins on a graph and a particle hopping between its nodes. The quantum state is build sequentially, applying a unitary transformation that couples neighboring spins and, at a…
Given two arbitrary pure states $ |\phi>$ and $ |\psi>$ of qubits or higher level states, we provide arguments in favor of states of the form $ \frac{1}{\sqrt{2}}(|\psi> |\phi> + i |\phi> |\psi>) $ instead of symmetric or anti-symmetric…
Looking for a quantum-mechanical implementation of duality, we formulate a relation between coherent states and complex-differentiable structures on classical phase space ${\cal C}$. A necessary and sufficient condition for the existence of…
Symmetries in a network regulate its organization into functional clustered states. Given a generic ensemble of nodes and a desirable cluster (or group of clusters), we exploit the direct connection between the elements of the eigenvector…
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…