Related papers: Geometric Effects and Computation in Spin Networks
Quantum Markov networks are a generalization of quantum Markov chains to arbitrary graphs. They provide a powerful classification of correlations in quantum many-body systems---complementing the area law at finite temperature---and are…
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 unitary control pulse design method for a scalable quantum computer architecture based on electron spins in lateral quantum dots. We employ simultaneous control of spin interactions and derive the functional forms of spin…
Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the…
We explore the physical mechanism to coherently transfer the quantum information of spin by connecting two spins to an isotropic antiferromagnetic spin ladder system as data bus. Due to a large spin gap existing in such a perfect medium,…
The discrete picture of geometry arising from the loop representation of quantum gravity can be extended by a quantum deformation. The operators for area and volume defined in the q-deformation of the theory are partly diagonalized. The…
Using concepts of geometric orthogonality and linear independence, we logically deduce the form of the Pauli spin matrices and the relationships between the three spatially orthogonal basis sets of the spin-1/2 system. Rather than a…
An adiabatic cyclic evolution of control parameters of a quantum system ends up with a holonomic operation on the system, determined entirely by the geometry in the parameter space. The operation is given either by a simple phase factor (a…
We present a method that implement directional, perfect state transfers within a branched spin network by exploiting quantum interferences in the time-domain. That provides a tool to isolate subsystems from a large and complex one.…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
It is shown how to systematically construct the $XX$ quantum spin chains with nearest-neighbor interactions that allow perfect state transfer (PST). Sets of orthogonal polynomials (OPs) are in correspondence with such systems. The key…
All elementary Hamiltonians in nature are expected to be invariant under rotation. Despite this restriction, we usually assume that any arbitrary measurement or unitary time evolution can be implemented on a physical system, an assumption…
We have studied quantum systems on finite-dimensional Hilbert spaces and found that all these systems are connected through local transformations. Actually, we have shown that these transformations give rise to a gauge group that connects…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
Given its importance to many other areas of physics, from condensed matter physics to thermodynamics, time-reversal symmetry has had relatively little influence on quantum information science. Here we develop a network-based picture of…
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical…
A quantum computing circuit is presented that approximates a single spin wave quantum on a linear chain of spin 1/2 particles described by a Heisenberg Hamiltonian. The circuit is a product state where each qubit represents a spin. The spin…
We present a new implementation of quantum computation that treats quantum computers as a special type of Bayesian Network called a QuDot Net. QuDot Nets allow for the efficient representation of some qubit systems. Single qubit quantum…
We discuss the extension of loop quantum gravity to topspin networks, a proposal which allows topological information to be encoded in spin networks. We will show that this requires minimal changes to the phase space, C*-algebra and Hilbert…
Spin chains are promising media for short-haul quantum communication. Their usefulness is manifested in all those situations where stationary information carriers are involved. In the majority of the communication schemes relying on quantum…