Related papers: Formation of Multipartite Entanglement Using Rando…
While the scaling of entanglement in a quantum system can be used to distinguish many-body quantum phases, it is usually hard to quantify the amount of entanglement in mixed states of open quantum systems, while measuring entanglement…
We show that the expectation value of squared correlations measured along random local directions is an identifier of quantum entanglement in pure states which can be directly experimentally assessed if two copies of the state were…
Experimentally quantifying entanglement and coherence are extremely important for quantum resource theory. However, because the quantum state tomography requires exponentially growing measurements with the number of qubits, it is hard to…
The concept of relative state is used to introduce geometric phases that originate from correlations in states of composite quantum systems. In particular, we identify an entanglement-induced geometric phase in terms of a weighted average…
We calculate the amount of entanglement of the multiqubit quantum states employed in the Grover algorithm, by following its dynamics at each step of the computation. We show that genuine multipartite entanglement is always present.…
We propose the usage of persistent homologies to characterize multipartite entanglement. On a multi-qubit data set we introduce metric-like measures defined only in terms of bipartite entanglement and then we derive barcodes. We show that…
We propose a modular quantum computation architecture based on utilizing multipartite entanglement. Each module consists of a small-scale quantum computer comprising data, memory and entangling qubits. Entangling qubits are used to…
Quantum walks constitute a rich area of quantum information science, where multipartite entanglement plays a central role in the dynamics and scalability of quantum advantage over classical simulators. In this work, we study the…
We introduce a purely geometric formulation for two different measures addressed to quantify the entanglement between different parts of a tripartite qubit system. Our approach considers the entanglement-polytope defined by the smallest…
The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate…
The thesis includes the original results of our articles [30, 37, 40, 42, 51, 53, 75]. A method is developed to compute analytically entanglement measures of three-qubit pure states. Owing to it closed-form expressions are presented for the…
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…
We introduce a measure Q of bipartite quantum correlations for arbitrary two-qubit states, expressed as a state-independent function of the density matrix elements. The amount of quantum correlations can be quantified experimentally by…
Evolution of entanglement with the proceeding of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one.…
We use the geometry of the moment map to investigate properties of pure entangled states of composite quantum systems. The orbits of equally entangled states are mapped by the moment map on coadjoint orbits of local transformations (unitary…
The distribution of entanglement in a multiparty system can be described through the principles of monogamy or polygamy. Monogamy is a fundamental characteristic of entanglement that restricts its distribution among several number of…
We present an analytical approach to evaluate the geometric measure of multiparticle entanglement for mixed quantum states. Our method allows the computation of this measure for a family of multiparticle states with a certain symmetry and…
Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
We derive a general relation between the non-analyticities of the ground state energy and those of a subclass of the multipartite generalized global entanglement (GGE) measure defined by T. R. de Oliveira et al. [Phys. Rev. A 73, 010305(R)…