scholarly journals Finite-Temperature Matrix Product State Algorithms and Applications

2013 ◽  
pp. 345-354
Author(s):  
Michael L. Wall ◽  
Lincoln D. Carr
Entropy ◽  
2021 ◽  
Vol 23 (1) ◽  
pp. 77
Author(s):  
Angus J. Dunnett ◽  
Alex W. Chin

Simulating the non-perturbative and non-Markovian dynamics of open quantum systems is a very challenging many body problem, due to the need to evolve both the system and its environments on an equal footing. Tensor network and matrix product states (MPS) have emerged as powerful tools for open system models, but the numerical resources required to treat finite-temperature environments grow extremely rapidly and limit their applications. In this study we use time-dependent variational evolution of MPS to explore the striking theory of Tamascelli et al. (Phys. Rev. Lett. 2019, 123, 090402.) that shows how finite-temperature open dynamics can be obtained from zero temperature, i.e., pure wave function, simulations. Using this approach, we produce a benchmark dataset for the dynamics of the Ohmic spin-boson model across a wide range of coupling strengths and temperatures, and also present a detailed analysis of the numerical costs of simulating non-equilibrium steady states, such as those emerging from the non-perturbative coupling of a qubit to baths at different temperatures. Despite ever-growing resource requirements, we find that converged non-perturbative results can be obtained, and we discuss a number of recent ideas and numerical techniques that should allow wide application of MPS to complex open quantum systems.


2011 ◽  
Vol 13 (9) ◽  
pp. 093041 ◽  
Author(s):  
Bing-Quan Hu ◽  
Xi-Jing Liu ◽  
Jin-Hua Liu ◽  
Huan-Qiang Zhou

Quantum ◽  
2019 ◽  
Vol 3 ◽  
pp. 116 ◽  
Author(s):  
Aidan Dang ◽  
Charles D. Hill ◽  
Lloyd C. L. Hollenberg

We detail techniques to optimise high-level classical simulations of Shor's quantum factoring algorithm. Chief among these is to examine the entangling properties of the circuit and to effectively map it across the one-dimensional structure of a matrix product state. Compared to previous approaches whose space requirements depend on r, the solution to the underlying order-finding problem of Shor's algorithm, our approach depends on its factors. We performed a matrix product state simulation of a 60-qubit instance of Shor's algorithm that would otherwise be infeasible to complete without an optimised entanglement mapping.


2019 ◽  
Vol 31 (7) ◽  
pp. 1499-1517 ◽  
Author(s):  
Amandeep Singh Bhatia ◽  
Mandeep Kaur Saggi ◽  
Ajay Kumar ◽  
Sushma Jain

Interest in quantum computing has increased significantly. Tensor network theory has become increasingly popular and widely used to simulate strongly entangled correlated systems. Matrix product state (MPS) is a well-designed class of tensor network states that plays an important role in processing quantum information. In this letter, we show that MPS, as a one-dimensional array of tensors, can be used to classify classical and quantum data. We have performed binary classification of the classical machine learning data set Iris encoded in a quantum state. We have also investigated its performance by considering different parameters on the ibmqx4 quantum computer and proved that MPS circuits can be used to attain better accuracy. Furthermore the learning ability of an MPS quantum classifier is tested to classify evapotranspiration (ET[Formula: see text]) for the Patiala meteorological station located in northern Punjab (India), using three years of a historical data set (Agri). We have used different performance metrics of classification to measure its capability. Finally, the results are plotted and the degree of correspondence among values of each sample is shown.


Sign in / Sign up

Export Citation Format

Share Document