scholarly journals Preparing exact eigenstates of the open XXZ chain on a quantum computer

Author(s):  
John S. Van Dyke ◽  
Edwin Barnes ◽  
Sophia Economou ◽  
Rafael I Nepomechie

Abstract The open spin-1/2 XXZ spin chain with diagonal boundary magnetic fields is the paradigmatic example of a quantum integrable model with open boundary conditions. We formulate a quantum algorithm for preparing Bethe states of this model, corresponding to real solutions of the Bethe equations. The algorithm is probabilistic, with a success probability that decreases with the number of down spins. For a Bethe state of L spins with M down spins, which contains a total of (L M) 2M M! terms, the algorithm requires L + M2+ 2M qubits.

1998 ◽  
Vol 39 (9) ◽  
pp. 4746-4758 ◽  
Author(s):  
Heng Fan ◽  
Bo-Yu Hou ◽  
Guang-Liang Li ◽  
Kang-Jie Shi ◽  
Yan-Shen Wang

1998 ◽  
Vol 13 (24) ◽  
pp. 4213-4226 ◽  
Author(s):  
GUO-XING JU ◽  
SHI-KUN WANG ◽  
KE WU ◽  
CHI XIONG

We analyze the symmetries of the reflection equation for open XYZ model and find their solutions K± case by case. In the general open boundary conditions, the Lax pair for open one-dimensional XYZ spin-chain is given.


2012 ◽  
Vol 12 (9&10) ◽  
pp. 876-892
Author(s):  
Ben W. Reichardt

A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented with limited quasiparticle braiding capabilities, in fact using only a single mobile quasiparticle, if the system can be properly initialized by measurements. It is also known that measurements alone suffice without any braiding, provided that the measurement devices can be dynamically created and modified. We study a model in which both measurement and braiding capabilities are limited. Given the ability to pull nontrivial Fibonacci anyon pairs from the vacuum with a certain success probability, we show how to simulate universal quantum computation by braiding one quasiparticle and with only one measurement, to read out the result. The difficulty lies in initializing the system. We give a systematic construction of a family of braid sequences that initialize to arbitrary accuracy nontrivial composite anyons. Instead of using the Solovay-Kitaev theorem, the sequences are based on a quantum algorithm for convergent search.


2021 ◽  
Vol 26 ◽  
Author(s):  
T. Berry ◽  
J. Sharpe

Abstract This paper introduces and demonstrates the use of quantum computers for asset–liability management (ALM). A summary of historical and current practices in ALM used by actuaries is given showing how the challenges have previously been met. We give an insight into what ALM may be like in the immediate future demonstrating how quantum computers can be used for ALM. A quantum algorithm for optimising ALM calculations is presented and tested using a quantum computer. We conclude that the discovery of the strange world of quantum mechanics has the potential to create investment management efficiencies. This in turn may lead to lower capital requirements for shareholders and lower premiums and higher insured retirement incomes for policyholders.


2021 ◽  
Vol 2 (1) ◽  
pp. 1-35
Author(s):  
Adrien Suau ◽  
Gabriel Staffelbach ◽  
Henri Calandra

In the last few years, several quantum algorithms that try to address the problem of partial differential equation solving have been devised: on the one hand, “direct” quantum algorithms that aim at encoding the solution of the PDE by executing one large quantum circuit; on the other hand, variational algorithms that approximate the solution of the PDE by executing several small quantum circuits and making profit of classical optimisers. In this work, we propose an experimental study of the costs (in terms of gate number and execution time on a idealised hardware created from realistic gate data) associated with one of the “direct” quantum algorithm: the wave equation solver devised in [32]. We show that our implementation of the quantum wave equation solver agrees with the theoretical big-O complexity of the algorithm. We also explain in great detail the implementation steps and discuss some possibilities of improvements. Finally, our implementation proves experimentally that some PDE can be solved on a quantum computer, even if the direct quantum algorithm chosen will require error-corrected quantum chips, which are not believed to be available in the short-term.


2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Linhu Li ◽  
Ching Hua Lee ◽  
Jiangbin Gong

AbstractNon-Hermitian systems have been shown to have a dramatic sensitivity to their boundary conditions. In particular, the non-Hermitian skin effect induces collective boundary localization upon turning off boundary coupling, a feature very distinct from that under periodic boundary conditions. Here we develop a full framework for non-Hermitian impurity physics in a non-reciprocal lattice, with periodic/open boundary conditions and even their interpolations being special cases across a whole range of boundary impurity strengths. We uncover steady states with scale-free localization along or even against the direction of non-reciprocity in various impurity strength regimes. Also present are Bloch-like states that survive albeit broken translational invariance. We further explore the co-existence of non-Hermitian skin effect and scale-free localization, where even qualitative aspects of the system’s spectrum can be extremely sensitive to impurity strength. Specific circuit setups are also proposed for experimentally detecting the scale-free accumulation, with simulation results confirming our main findings.


Sign in / Sign up

Export Citation Format

Share Document