Please use this identifier to cite or link to this item: http://hdl.handle.net/10497/23516
Title: 
Authors: 
Subjects: 
Algorithms
Near-term
Quantum
Issue Date: 
2021
Citation: 
Lim, K. H., Haug, T., Kwek, L. C., & Bharti, K. (2021). Fast-forwarding with NISQ processors without feedback loop. Quantum Science and Technology, 7(1), Article 015001. https://doi.org/10.1088/2058-9565/ac2e52
Journal: 
Quantum Science and Technology
Abstract: 
Simulating quantum dynamics is expected to be performed more easily on a quantum computer than on a classical computer. However, the currently available quantum devices lack the capability to implement fault-tolerant quantum algorithms for quantum simulation. Hybrid classical quantum algorithms such as the variational quantum algorithms have been proposed to effectively use current term quantum devices. One promising approach to quantum simulation in the noisy intermediate-scale quantum (NISQ) era is the diagonalisation based approach, with some of the promising examples being the subspace variational quantum simulator (SVQS), variational fast forwarding (VFF), fixed-state variational fast forwarding (fs-VFF), and the variational Hamiltonian diagonalisation (VHD) algorithms. However, these algorithms require a feedback loop between the classical and quantum computers, which can be a crucial bottleneck in practical application. Here, we present the classical quantum fast forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation. CQFF shares some similarities with SVQS, VFF, fs-VFF and VHD but removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries. The CQFF algorithm does not suffer from the barren plateau problem and the accuracy can be systematically increased. Furthermore, if the Hamiltonian to be simulated is expressed as a linear combination of tensored-Pauli matrices, the CQFF algorithm reduces to the task of sampling some many-body quantum state in a set of Pauli-rotated bases, which is easy to do in the NISQ era. We run the CQFF algorithm on existing quantum processors and demonstrate the promise of the CQFF algorithm for current-term quantum hardware. We compare CQFF with Trotterization for a XY spin chain model Hamiltonian and find that the CQFF algorithm can simulate the dynamics more than 105 times longer than Trotterization on current-term quantum hardware. This provides a 104 times improvement over the previous record.
URI: 
ISSN: 
2058-9565 (online)
DOI: 
Project number: 
EP/T001062/1
Funding Agency: 
UK National Quantum Technologies Programme with funding from UKRI EPSRC Grant
File Permission: 
Open
File Availability: 
With file
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
QST-7-1-015001.pdf661.69 kBAdobe PDFThumbnail
View/Open
Show full item record

SCOPUSTM   
Citations

2
checked on Mar 14, 2023

WEB OF SCIENCETM
Citations

4
checked on Mar 17, 2023

Page view(s)

48
checked on Mar 17, 2023

Download(s)

8
checked on Mar 17, 2023

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.