Related papers: Bounds on universal quantum computation with pertu…
We discuss the potential and limitations of Gaussian cluster states for measurement-based quantum computing. Using a framework of Gaussian projected entangled pair states (GPEPS), we show that no matter what Gaussian local measurements are…
Identifying quantum phase transitions poses a significant challenge in condensed matter physics, as this requires methods that both provide accurate results and scale well with system size. In this work, we demonstrate how relaxation…
We introduce perturbation and coupled-cluster theories based on a cluster mean-field reference for describing the ground state of strongly-correlated spin systems. In cluster mean-field, the ground state wavefunction is written as a simple…
We present a scheme to generate two-dimensional cluster state efficiently. The number of the basic gate-entangler-for the operation is in the order of the entanglement bonds of a cluster state, and could be reduced greatly if one uses them…
The common spin Hamiltonians such as the Ising, XY, or Heisenberg model do not have ground states that are the graph states needed in measurement-based quantum computation. Various highly-entangled many-body states have been suggested as a…
We consider translationally invariant quantum spin-$\frac{1}{2}$ chains with local interactions and a discrete symmetry that is spontaneously broken at zero temperature. We envision experimenters switching off the couplings between two…
We propose a framework to design concurrently a frustration-free quantum many-body Hamiltonian and its numerically exact ground states on a sufficiently large finite-size cluster in one and two dimensions using an elementary matrix product…
Cluster states are an essential component in one-way quantum computation protocols. We present two schemes to generate addressable continuous-variable cluster states from quadrature squeezed cylindrically polarized modes. By including…
In this study, we demonstrate the possibility of the implementation of universal Gaussian computation on a two-node cluster state ensemble. We consider the phase-locked sub-Poissonian lasers, which radiate the bright light with squeezed…
Efficient preparation of many-body ground states is key to harnessing the power of quantum computers in studying quantum many-body systems. In this work, we propose a simple method to design exact linear-depth parameterized quantum circuits…
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…
We describe a phase transition for long-range entanglement in a three-dimensional cluster state affected by noise. The partially decohered state is modeled by the thermal state of a suitable Hamiltonian. We find that the temperature at…
In this work, we develop a theoretical description of the collective behavior of interacting dipolar planar rotors by using time independent perturbation theory and a small angle quadratic approximation. The ground state properties for both…
Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a…
We explore the phase diagram of Ising spins on one-dimensional chains which criss-cross in two perpendicular directions and which are connected by interchain couplings. This system is of interest as a simpler, classical analog of a quantum…
The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms…
Measurement-based quantum computation, an alternative paradigm for quantum information processing, uses simple measurements on qubits prepared in cluster states, a class of multiparty entangled states with useful properties. Here we propose…
We characterize the set of ground states that can be synthesized by classical 2-body Ising Hamiltonians. We then construct simple Ising planar blocks that simulates efficiently a universal set of logic gates and connections, and hence any…
Here, the entanglement entropy is calculated at the quantum multicritical point of the random transverse-field Ising model (RTIM). We use an efficient implementation of the strong disorder renormalization group method in two and three…