Related papers: Geometry of Discrete Quantum Computing
The paradigm of measurement-based quantum computation opens new experimental avenues to realize a quantum computer and deepens our understanding of quantum physics. Measurement-based quantum computation starts from a highly entangled…
We show that the manifold of quantum states is endowed with a rich and nontrivial geometric structure. We derive the Fubini-Study metric of the projective Hilbert space of a multi-qubit quantum system, endowing it with a Riemannian metric…
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering,…
The computational complexity of a quantum state quantifies how hard it is to make. `Complexity geometry', first proposed by Nielsen, is an approach to defining computational complexity using the tools of differential geometry. Here we…
The geometric formulation of quantum mechanics is a very interesting field of research which has many applications in the emerging field of quantum computation and quantum information, such as schemes for optimal quantum computers. In this…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
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…
Tensor networks impose a notion of geometry on the entanglement of a quantum system. In some cases, this geometry is found to reproduce key properties of holographic dualities, and subsequently much work has focused on using tensor networks…
Entanglement for pure bipartite states is most commonly quantified in a state-by-state manner to each pure state of a bipartite system a scalar quantity, such as the von Neumann entropy of a reduced density matrix. This provides a precise…
We show that the Hilbert space spanned by a continuously parametrized wavefunction family---i.e., a quantum state manifold---is dominated by a subspace, onto which all member states have close to unity projection weight. Its characteristic…
We present a complete classification of the geometry of the mutually complementary sets of entangled and separable states in three-dimensional Hilbert subspaces of bipartite and multipartite quantum systems. Our analysis begins by finding…
We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…
We present a description of entanglement in composite quantum systems in terms of symplectic geometry. We provide a symplectic characterization of sets of equally entangled states as orbits of group actions in the space of states. In…
We present a generalization to 3-qubits of the standard Bloch sphere representation for a single qubit and of the 7-dimensional sphere representation for 2 qubits presented in Mosseri {\it et al.}\cite{Mosseri2001}. The Hilbert space of the…
We show how to represent the state and the evolution of a quantum computer (or any system with an $N$--dimensional Hilbert space) in phase space. For this purpose we use a discrete version of the Wigner function which, for arbitrary $N$, is…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
Holonomic quantum computation exploits a quantum state's non-trivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation. Holonomies arising from systems where the Hamiltonian traces a continuous path through…
A new functional calculus, developed recently for a fully non-perturbative treatment of quantum gravity, is used to begin a systematic construction of a quantum theory of geometry. Regulated operators corresponding to areas of 2-surfaces…
The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks. We introduce a new approach in…
A discrete quantum process is defined as a sequence of local states $\rho_t$, $t=0,1,2,...$, satisfying certain conditions on an $L_2$ Hilbert space $H$. If $\rho =\lim\rho_t$ exists, then $\rho$ is called a global state for the system. In…