Related papers: Localizing genuine multiparty entanglement in nois…
Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from…
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expects quantum advantage. In this work, we present a highly…
Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC)…
Graph states are entangled resource states for universal measurement-based quantum computation. Although matter qubits such as superconducting circuits and trapped ions are promising candidates to generate graph states, it is…
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the…
This thesis is an attempt to enhance understanding of the following questions A- Given a multipartite quantum state (possibly mixed), how to find out whether it is entangled or separable? (Detection of entanglement.) B- Given an entangled…
We propose a scalable and deterministic protocol for growing large multi-qubit states starting from two-qubit non-maximally entangled pure states, where the bipartite entanglement in the resultant state is higher than the maximum of the…
Bipartite entangled states between a qubit and macroscopically distinct states of a mesoscopic system, known as micro-macro entangled states, are emerging resources for quantum information processing. One main challenge in generating such…
Despite the exponential overhead to describe general multi-qubit quantum states and processes, efficient methods for certain state families and operations have been developed and utilised. The stabilizer formalism and the Gottesman-Knill…
The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146…
Entanglement plays a crucial role in quantum information science and many-body physics, yet quantifying it in mixed quantum many-body systems has remained a notoriously difficult problem. Here, we introduce families of quantitative…
A Multipartite entangled state has many different kinds of entanglement specified by the number of partitions. The most essential example of multipartite entanglement is the entanglement of multi-qubit Greenberger-Horne-Zeilinger (GHZ)…
Fathoming out quantum state space is a challenging endeavor due to its exponentially growing dimensionality. At the expense of being bound in its expressiveness, the discrete and finite subspace of graph states is easier to investigate via…
In this work, we study the asymptotic behavior of protocols that localize entanglement in large multi-qubit states onto a subset of qubits by measuring the remaining qubits. We use the maximal average n-tangle that can be generated on a…
The ability to preserve multipartite entanglement in noisy environments is central to advancing quantum information processing. In this work, we develop a semiclassical theoretical model of three entangled qubits exposed to local Markov…
Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of…
Multiparty quantum states are useful for a variety of quantum information and computation protocols. We define a multiparty entanglement measure based on local measurements on a multiparty quantum state, and an entanglement measure averaged…
Entanglement is one of the fundamental properties of a quantum state and is a crucial differentiator between classical and quantum computation. There are many ways to define entanglement and its measure, depending on the problem or…
We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $\Omega(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions…
Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we propose a protocol that utilizes a Bell sampling subroutine…