Efficient adiabatic preparation of tensor network states

The preparation of nontrivial states is crucial to the study of quantum many-body physics. Such states can be prepared with adiabatic quantum algorithms, which are restricted by the minimum spectral gap along the path. In this Letter, we propose an efficient method to adiabatically prepare tensor network states (TNSs). We maximize the spectral gap leveraging degrees of freedom in the parent Hamiltonian construction. We demonstrate this efficient adiabatic algorithm for preparing TNSs, through examples of random TNSs in one dimension, AKLT (Affleck-Kennedy-Lieb-Tasaki), and GHZ states. The Hamiltonian optimization applies to both injective and non-injective tensors, in the latter case by exploiting symmetries present in the tensors.

A Busy March Meeting Is Brewing in Seattle

Motivated by recent experiments on Bi$_3$Mn$_4$O$_{12}$(NO$_3$), and a broader interest arising from numerical work on the honeycomb lattice Hubbard model, we have studied the effect of a magnetic field on honeycomb lattice spin models with quantum paramagnetic ground states. For a model with frustrating second-neighbor exchange, $J_2$, we use a Lindemann-like criterion within spin wave theory to show that N\'eel order melts beyond a critical $J_2$. The critical $J_2$ increases with a magnetic field, implying the existence of a field-induced paramagnet-N\'eel transition over a range of $J_2$. We also study bilayer model using a spin-$S$ generalization of bond operator mean field theory. We show that there is a N\'eel-dimer transition for various spin values with increasing bilayer coupling, and that the resulting interlayer dimer state undergoes a field induced transition into a state with transverse N\'eel order. Finally, we study a spin-3/2 model which interpolates between the Heisenberg model and the Affleck-Kennedy-Lieb-Tasaki (AKLT) parent Hamiltonian. Using exact diagonalization, we compute the fidelity susceptibility to locate the Neel-AKLT quantum critical point, obtain the spin gap of the AKLT parent Hamiltonian, and argue that AKLT state also undergoes field-induced Neel ordering.

Two types of dynamic quantum state secret sharing based on tensor networks states

Adiabatic preparation of the ground states of many-body Hamiltonians in the closed system limit is at the heart of adiabatic quantum computation, but in reality systems are always open. This motivates a natural comparison between, on the one hand, adiabatic preparation of steady states of Lindbladian generators and, on the other hand, relaxation towards the same steady states subject to the final Lindbladian of the adiabatic process. In this work we thus adopt the perspective that the goal is the most efficient possible preparation of such steady states, rather than ground states. Using known rigorous bounds for the open-system adiabatic theorem and for mixing times, we are then led to a disturbing conclusion that at first appears to doom efforts to build physical quantum annealers: relaxation seems to always converge faster than adiabatic preparation. However, by carefully estimating the adiabatic preparation time for Lindbladians describing thermalization in the low temperature limit, we show that there is, after all, room for an adiabatic speedup over relaxation. To test the analytically derived bounds for the adiabatic preparation time and the relaxation time, we numerically study three models: a dissipative quasi-free fermionic chain, a single qubit coupled to a thermal bath, and the "spike" problem of $n$ qubits coupled to a thermal bath. Via these models we find that the answer to the "which wins" question depends for each model on the temperature and the system-bath coupling strength. In the case of the "spike" problem we find that relaxation during the adiabatic evolution plays an important role in ensuring a speedup over the final-time relaxation procedure. Thus, relaxation-assisted adiabatic preparation can be more efficient than both pure adiabatic evolution and pure relaxation.

Fault-tolerant quantum error correction provides a strategy to protect information processed by a quantum computer against noise which would otherwise corrupt the data. A fault-tolerant universal quantum computer must implement a universal gate set on the logical level in order to perform arbitrary calculations to in principle unlimited precision. In this paper we characterize the recent demonstration of a fault-tolerant universal gate set in a trapped-ion quantum computer [Postler et al., Nature (London) 605, 7911 (2022)] and identify aspects to improve the design of experimental setups to reach an advantage of logical over physical qubit operation. We show that various criteria to assess the break-even point for fault-tolerant quantum operations are within reach for the ion trap quantum computing architecture under consideration. Furthermore, we analyze the influence of crosstalk in entangling gates for logical state preparation circuits. These circuits can be designed to respect fault tolerance for specific microscopic noise models. We find that an experimentally informed depolarizing noise model captures the essential noise dynamics of the fault-tolerant experiment that we consider, and crosstalk is negligible in the currently accessible regime of physical error rates. For deterministic Pauli state preparation, we provide a fault-tolerant unitary logical qubit initialization circuit, which can be realized without in-sequence measurement and feed-forward of classical information. Additionally, we show that nondeterministic state preparation schemes, i.e., repeat until success, for logical Pauli and magic states perform with higher logical fidelity over their deterministic counterparts for the current and anticipated future regime of physical error rates. Our results offer guidance on improvements of physical qubit operations and validate the experimentally informed noise model as a tool to predict logical failure rates in quantum computing architectures based on trapped ions.

Quantum phase transitions materialize as level crossings in the ground-state energy when the parameters of the Hamiltonian are varied. The resulting ground-state phase diagrams are straightforward to determine by exact diagonalization on classical computers, but are challenging on quantum computers because of the accuracy needed and the near degeneracy of the competing states close to the level crossings. On the other hand, classical computers are limited to small system sizes, which quantum computers may help overcome. In this work, we use a local adiabatic ramp for state preparation to allow us to directly compute ground-state phase diagrams on a quantum computer via time evolution. This methodology is illustrated by examining the ground states of the XY model with a magnetic field in the z-direction in one dimension. We are able to calculate an accurate phase diagram on both two- and three-site systems using IBM quantum machines.

Developing quantum systems which are robust against noise are of prime importance to the realisation of quantum technologies. Without fault tolerance, we will never be able to preserve delicate quantum states for macroscopic time scales, a necessary requirement in the construction of scalable quantum computer. Topologically ordered models offer very beautiful mechanisms for preserving quantum states. In such models, quantum information is encoded globally over a degenerate topological Hilbert space which offers a natural robustness against local environmental noise. Remarkably, topological order is present in certain realistic condensed-matter systems. This provides a platform for accessing topological order in a laboratory. Moreover, considering condensed-matter systems enables us to combine topological features with other physical effects to enhance their behaviour. In this Thesis we study the physics of topologically ordered lattice models with defects. We seek practical applications of lattice defects for the realisation of a fault-tolerant quantum computer. The first result we present shows that anyonic data of point-like lattice defects, called twists, can be found by measuring the entanglement of the ground state of the host system. The data we learn relates to the capacity of a twist defect to perform quantum computational tasks. The second result in this Thesis concerns the dynamics of the qudit toric code model with line-like defects coupled to a thermal bath. We show we can entropically inspire fragile glassy dynamics in the system. Such dynamics qualitatively improve the coherence times of quantum information encoded in the ground state of the lattice. A novel way of achieving fault-tolerant quantum computation is by producing and manipulating twist defects of topologically ordered systems. In many ways, this paradigm of topological quantum computation is analogous to quantum computation using anyons. The first area of study in this Thesis extends the analogy between anyons and twists. Specifically, we show that the anyonic data of twists in Kitaev’s toric code model can be extracted

We elucidate the deep connection between the PXP model, which is a standard model of quantum many-body scars, and the Affleck–Kennedy–Lieb–Tasaki (AKLT) Hamiltonian. Using the framework of embedded Hamiltonians, we establish the connection between the PXP Hamiltonian and the AKLT Hamiltonian, which clarifies the reason why the PXP Hamiltonian has nonthermal energy eigenstates similar to the AKLT state. Through this analysis, we find that the presence of such nonthermal energy eigenstates reflects the symmetry in the AKLT Hamiltonian.

Thermal properties of nanomaterials are crucial to not only improving our fundamental understanding of condensed matter systems, but also to developing novel materials for applications spanning research and industry. Since quantum effects arise at the nano-scale, these systems are difficult to simulate on classical computers. Quantum computers can efficiently simulate quantum many-body systems, yet current quantum algorithms for calculating thermal properties of these systems incur significant computational costs in that they either prepare the full thermal state on the quantum computer, or they must sample a number of pure states from a distribution that grows with system size. Canonical thermal pure quantum (TPQ) states provide a promising path to estimating thermal properties of quantum materials as they neither require preparation of the full thermal state nor require a growing number of samples with system size. Here, we present an algorithm for preparing canonical TPQ states on quantum computers. We compare three different circuit implementations for the algorithm and demonstrate their capabilities in estimating thermal properties of quantum materials. Due to its increasing accuracy with system size and flexibility in implementation, we anticipate that this method will enable finite temperature explorations of relevant quantum materials on near-term quantum computers.

International Journal of Quantum ChemistryVolume 51, Issue 1 p. 1-2 Editorial International journal of quantum chemistry—A journal devoted to quantum theory and computations in chemistry, condensed matter physics, and biology. Editorial—program and policies Per-Olov Löwdin, Per-Olov Löwdin Editor-in-chiefSearch for more papers by this author Per-Olov Löwdin, Per-Olov Löwdin Editor-in-chiefSearch for more papers by this author First published: 15 June 1994 https://doi.org/10.1002/qua.560510102AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat No abstract is available for this article. Volume51, Issue115 June 1994Pages 1-2 RelatedInformation

The original motivation to build a quantum computer came from Feynman, who imagined a machine capable of simulating generic quantum mechanical systems--a task that is believed to be intractable for classical computers. Such a machine could have far-reaching applications in the simulation of many-body quantum physics in condensed-matter, chemical and high-energy systems. Part of Feynman's challenge was met by Lloyd, who showed how to approximately decompose the time evolution operator of interacting quantum particles into a short sequence of elementary gates, suitable for operation on a quantum computer. However, this left open the problem of how to simulate the equilibrium and static properties of quantum systems. This requires the preparation of ground and Gibbs states on a quantum computer. For classical systems, this problem is solved by the ubiquitous Metropolis algorithm, a method that has basically acquired a monopoly on the simulation of interacting particles. Here we demonstrate how to implement a quantum version of the Metropolis algorithm. This algorithm permits sampling directly from the eigenstates of the Hamiltonian, and thus evades the sign problem present in classical simulations. A small-scale implementation of this algorithm should be achievable with today's technology.

Phenomena include the Kosterlitz-Thouless phase transition, fractional quantum Hall effect, and high-temperature superconductivity have driven advances in condensed matter physics, offering a foundation for the investigation of superconductivity and the quantum Hall effect, as well as aiding in the comprehension of the behavior of strongly correlated electrons. The discovery of topological insulators and the preparation of graphene triggered important breakthroughs 20 years ago, leading to novel phenomena include topological superconductivity, the quantum anomalous Hall effect, corner graphene, and quantum spin liquids, which opened new directions in quantum materials research. Through the study of topological superconductors and flat band effects, this paper elucidates the role of topological energy band theory in describing Majorana fermions and their non-abelian statistical properties and reveals the phenomena of superconductivity and Mott's insulating state due to strong electronic interactions in magic-angle cornering graphene. The results show that the theory of topological energy bands and flat band effects can explain the strongly correlated electronic effects, providing theoretical support for understanding the phase transition from Mott insulating states to superconducting states and the Majorana zero mode in quantum computation. This paper emphasizes the importance of topological and two-dimensional materials in the study of strongly correlated electrons, providing guidance for future research.

The seven-qubit quantum error-correcting code originally proposed by Steane is one of the best known quantum codes. The Steane code has a desirable property that most basic operations can be performed easily in a fault-tolerant manner. A major obstacle to fault-tolerant quantum computation with the Steane code is fault-tolerant preparation of encoded states, which requires large computational resources. Here we propose efficient state preparation methods for zero and magic states encoded with the Steane code, where the zero state is one of the computational basis states and the magic state allows us to achieve universality in fault-tolerant quantum computation. The methods minimize resource overheads for the fault-tolerant state preparation, and therefore reduce necessary resources for quantum computation with the Steane code. Thus, the present results will open a new possibility for efficient fault-tolerant quantum computation.

Ultracold atoms trapped by light offer robust quantum coherence and controllability, providing an attractive system for quantum information processing and for the simulation of complex problems in condensed matter physics. Many quantum information processing schemes require the manipulation and deterministic entanglement of individual qubits; this would typically be accomplished using controlled, state-dependent, coherent interactions among qubits. Recent experiments have made progress towards this goal by demonstrating entanglement among an ensemble of atoms confined in an optical lattice. Until now, however, there has been no demonstration of a key operation: controlled entanglement between atoms in isolated pairs. Here we use an optical lattice of double-well potentials to isolate and manipulate arrays of paired (87)Rb atoms, inducing controlled entangling interactions within each pair. Our experiment realizes proposals to use controlled exchange coupling in a system of neutral atoms. Although 87Rb atoms have nearly state-independent interactions, when we force two atoms into the same physical location, the wavefunction exchange symmetry of these identical bosons leads to state-dependent dynamics. We observe repeated interchange of spin between atoms occupying different vibrational levels, with a coherence time of more than ten milliseconds. This observation demonstrates the essential component of a neutral atom quantum SWAP gate (which interchanges the state of two qubits). Its 'half-implementation', the root SWAP gate, is entangling, and together with single-qubit rotations it forms a set of universal gates for quantum computation.