Related papers: Geometry of Discrete Quantum Computing
Focusing particularly on one-qubit and two-qubit systems, I explain how the quantum state of a system of n qubits can be expressed as a real function--a generalized Wigner function--on a discrete 2^n x 2^n phase space. The phase space is…
We investigate several aspects of realizing quantum computation using entangled polar molecules in pendular states. Quantum algorithms typically start from a product state |00...0> and we show that up to a negligible error, the ground…
We present a technique to coarse-grain quantum states in a finite-dimensional Hilbert space. Our method is distinguished from other approaches by not relying on structures such as a preferred factorization of Hilbert space or a preferred…
A particularly simple description of separability of quantum states arises naturally in the setting of complex algebraic geometry, via the Segre embedding. This is a map describing how to take products of projective Hilbert spaces. In this…
The familiar Greenberger-Horne-Zeilinger (GHZ) states can be rewritten by entangling the Bell states for two qubits with a state of the third qubit, which is dubbed entangled entanglement. We show that in this way we obtain all 8…
This paper reviews recent attempts to describe the two- and three-qubit Hilbert space geometries with the help of Hopf fibrations. In both cases, it is shown that the associated Hopf map is strongly sensitive to states entanglement content.…
In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify…
We explore finite-field frameworks for quantum theory and quantum computation. The simplest theory, defined over unrestricted finite fields, is unnaturally strong. A second framework employs only finite fields with no solution to x^2+1=0,…
We introduce novel schemes for quantum computing based on local measurements on entangled resource states. This work elaborates on the framework established in [Phys. Rev. Lett. 98, 220503 (2007), quant-ph/0609149]. Our method makes use of…
Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…
Although the path-integral formalism is known to be equivalent to conventional quantum mechanics, it is not generally obvious how to implement path-based calculations for multi-qubit entangled states. Whether one takes the formal view of…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings [A. Shimony, Ann. NY.…
Measurement-based quantum computation describes a scheme where entanglement of resource states is utilized to simulate arbitrary quantum gates via local measurements. Recent works suggest that symmetry-protected topologically non-trivial,…
Based on an idea that spatial separation of charge states can enhance quantum coherence, we propose a scheme for quantum computation with quantum bit (qubit) constructed from two coupled quantum dots. Quantum information is stored in…
Physical constraints such as positivity endow the set of quantum states with a rich geometry if the system dimension is greater than two. To shed some light on the complicated structure of the set of quantum states, we consider a…
We report the creation of a wide range of quantum states with controllable degrees of entanglement and entropy using an optical two-qubit source based on spontaneous parametric downconversion. The states are characterised using measures of…
The geometry of quantum states provides a unifying framework for estimation processes based on quantum probes, and it allows to derive the ultimate bounds of the achievable precision. We show a relation between the statistical distance…
An emerging insight is that ground states of symmetry-protected topological orders (SPTO's) possess latent computational complexity in terms of their many-body entanglement. By introducing a fractional symmetry of SPTO, which requires the…
For finite-dimensional Hopf algebras, their classification in characteristic $0$ (e.g. over $\mathbb{C}$) has been investigated for decades with many fruitful results, but their structures in positive characteristic have remained elusive.…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…