Related papers: Small k-pairable states
Intrinsic symmetry of the existing protocols of quantum dialogue are explored. It is shown that if we have a set of mutually orthogonal $n$-qubit states {\normalsize $\{|\phi_{0}>,|\phi_{1}>,....,|\phi_{i}<,...,|\phi_{2^{n}-1}>\}$ and a set…
The difference between the two largest eigenvalues of the adjacency matrix of a graph $G$ is called the spectral gap of $G.$ If $G$ is a regular graph, then its spectral gap is equal to algebraic connectivity. Abdi, Ghorbani and Imrich, in…
We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein {\it et al.} [Phys. Rev. A \textbf{73}, 012320 (2006)]. The conjecture states…
We show that the problem of communication in a quantum computer reduces to constructing reliable quantum channels by distributing high-fidelity EPR pairs. We develop analytical models of the latency, bandwidth, error rate and resource…
Detecting genuine multipartite entanglement (GME) is a state-characterization task that benchmarks coherence and experimental control in quantum systems. Existing GME tests often require joint measurements on many qubits, posing challenges…
It is shown that generic N-party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all N-party pure states is…
Classical simulation of a programmable quantum processor is crucial in identifying the threshold of a quantum advantage. We demonstrate the simple update of projected entangled-pair states (PEPSs) in the Vidal gauge that represent random…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
The Kneser graph $K(n,k)$ is defined for integers $n$ and $k$ with $n \geq 2k$ as the graph whose vertices are all the $k$-subsets of $[n]=\{1,2,\ldots,n\}$ where two such sets are adjacent if they are disjoint. The Schrijver graph $S(n,k)$…
Semi-device-independent (SDI) randomness generation protocols based on Kochen-Specker contextuality offer the attractive features of compact devices, high rates, and ease of experimental implementation over fully device-independent (DI)…
Bilateral agreement based random undirected graphs were introduced and analyzed by La and Kabkab in 2015. The construction of the graph with $n$ vertices in this model uses a (random) preference order on other $n-1$ vertices and each vertex…
Probabilistic bit (p-bit)-based compute engines utilize the unique capability of a p-bit to probabilistically switch between two states to solve computationally challenging problems. However, when solving problems that require more than two…
We show that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIP-complete problem, can be solved by the verifier who can perform only single-qubit…
We demonstrate the capability of continuous variable Gaussian states to communicate multipartite quantum information. A quantum teamwork protocol is presented according to which an arbitrary possibly entangled multimode state can be…
Random many-body states are both a useful tool to model certain physical systems and an important asset for quantum computation. Realising them, however, generally requires an exponential (in system size) amount of resources. Recent…
Compared to general quantum states, the sparse states arise more frequently in the field of quantum computation. In this work, we consider the preparation for $n$-qubit sparse quantum states with $s$ non-zero amplitudes and propose two…
Graph states are the main computational building blocks of measurement-based computation and a useful tool for error correction in the gate model architecture. The graph states form a class of quantum states which are eigenvectors for the…
The $N$-qubit Dicke states $|D^N_k\rangle$, of Hamming-weight $k$, are a class of entangled states which play an important role in quantum algorithm optimization. We present a general calculation of entanglement entropy in Dicke states,…
We bring together in one place some of the main results and applications from our recent works in quantum information theory, in which we have brought techniques from operator theory, operator algebras, and graph theory for the first time…
In this work, we study the complexity of graph-state preparation. We consider general quantum algorithms consisting of Clifford operations acting on at most two qubits for graph-state preparations. We define the CZ-complexity of a graph…