ﻻ يوجد ملخص باللغة العربية
It has recently been established that cluster-like states -- states that are in the same symmetry-protected topological phase as the cluster state -- provide a family of resource states that can be utilized for Measurement-Based Quantum Computation. In this work, we ask whether it is possible to prepare cluster-like states in finite time without breaking the symmetry protecting the resource state. Such a symmetry-preserving protocol would benefit from topological protection to errors in the preparation. We answer this question in the positive by providing a Hamiltonian in one higher dimension whose finite-time evolution is a unitary that acts trivially in the bulk, but pumps the desired cluster state to the boundary. Examples are given for both the 1D cluster state protected by a global symmetry, and various 2D cluster states protected by subsystem symmetries. We show that even if unwanted symmetric perturbations are present in the driving Hamiltonian, projective measurements in the bulk along with post-selection is sufficient to recover a cluster-like state. For a resource state of size $N$, failure to prepare the state is negligible if the size of the perturbations are much smaller than $N^{-1/2}$.
Topological orders are a class of exotic states of matter characterized by patterns of long-range entanglement. Certain topologically ordered systems are proposed as potential realization of fault-tolerant quantum computation. Topological orders can
Preparing quantum thermal states on a quantum computer is in general a difficult task. We provide a procedure to prepare a thermal state on a quantum computer with a logarithmic depth circuit of local quantum channels assuming that the thermal state
The preparation of thermal equilibrium states is important for the simulation of condensed-matter and cosmology systems using a quantum computer. We present a method to prepare such mixed states with unitary operators, and demonstrate this technique
In this paper we propose an approach to prepare GHZ states of an arbitrary multi-particle system in terms of Grovers fast quantum searching algorithm. This approach can be regarded as an extension of the Grovers algorithm to find one or more items in an unsorted database.
Cluster expansions for the exponential of local operators are constructed using tensor networks. In contrast to other approaches, the cluster expansion does not break any spatial or internal symmetries and exhibits a very favourable prefactor to the