Anticipative measurements in hybrid quantum-classical computation

被引:2
作者
Heinosaari, Teiko [1 ,2 ]
Reitzner, Daniel [1 ]
Toigo, Alessandro [3 ,4 ]
机构
[1] VTT Tech Res Ctr Finland Ltd, Quantum Algorithms & Software, Espoo, Finland
[2] Univ Turku, Dept Phys & Astron, Turku 20014, Finland
[3] Politecn Milan, Dipartimento Matemat, Piazza Leonardo da Vinci 32, I-20133 Milan, Italy
[4] Ist Nazl Fis Nucl, Sez Milano, Via Celoria 16, I-20133 Milan, Italy
关键词
D O I
10.1103/PhysRevA.107.032612
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Until large-scale fault-tolerant quantum devices become available, one has to find ways to make the most of current noisy intermediate-scale quantum devices. One possibility is to seek smaller repetitive hybrid quantum -classical tasks with higher fidelity, rather than directly pursuing large complex tasks. We present an approach in this direction in which quantum computation is supplemented by a classical result. While the presence of the supplementary classical information is helpful in and of itself, taking advantage of its anticipation also leads to a distinct type of quantum measurement, which we call anticipative. Anticipative quantum measurements lead to an improved success rate compared with cases in which quantum measurements are optimized without assuming the subsequent arrival of supplementary information. Importantly, in an anticipative quantum measurement, we do not combine the results from classical and quantum computations until the end of the process, and there is no need for feedback from one computation to the other, thus both computations can be run in parallel. We demonstrate the method using an IBMQ device, and we show that it leads to an improved success rate even in a noisy setting.
引用
收藏
页数:11
相关论文
共 23 条
[1]  
Angara P.P., 2020, P 30 ANN INT C COMP, P247
[2]   Structure of minimum-error quantum state discrimination [J].
Bae, Joonwoo .
NEW JOURNAL OF PHYSICS, 2013, 15
[3]   Experimental Deep Reinforcement Learning for Error-Robust Gate-Set Design on a Superconducting Quantum Computer [J].
Baum, Yuval ;
Amico, Mirko ;
Howell, Sean ;
Hush, Michael ;
Liuzzi, Maggie ;
Mundada, Pranav ;
Merkh, Thomas ;
Carvalho, Andre R. R. ;
Biercuk, Michael J. .
PRX QUANTUM, 2021, 2 (04)
[4]   Noisy intermediate-scale quantum algorithms [J].
Bharti, Kishor ;
Cervera-Lierta, Alba ;
Kyaw, Thi Ha ;
Haug, Tobias ;
Alperin-Lea, Sumner ;
Anand, Abhinav ;
Degroote, Matthias ;
Heimonen, Hermanni ;
Kottmann, Jakob S. ;
Menke, Tim ;
Mok, Wai-Keong ;
Sim, Sukin ;
Kwek, Leong-Chuan ;
Aspuru-Guzik, Alan .
REVIEWS OF MODERN PHYSICS, 2022, 94 (01)
[5]   Trading Classical and Quantum Computational Resources [J].
Bravyi, Sergey ;
Smith, Graeme ;
Smolin, John A. .
PHYSICAL REVIEW X, 2016, 6 (02)
[6]   Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond [J].
Callison, Adam ;
Chancellor, Nicholas .
PHYSICAL REVIEW A, 2022, 106 (01)
[7]   Quantum guessing games with posterior information [J].
Carmeli, Claudio ;
Heinosaari, Teiko ;
Toigo, Alessandro .
REPORTS ON PROGRESS IN PHYSICS, 2022, 85 (07)
[8]   Witnessing incompatibility of quantum channels [J].
Carmeli, Claudio ;
Heinosaari, Teiko ;
Miyadera, Takayuki ;
Toigo, Alessandro .
JOURNAL OF MATHEMATICAL PHYSICS, 2019, 60 (12)
[9]   Quantum Incompatibility Witnesses [J].
Carmeli, Claudio ;
Heinosaari, Teiko ;
Toigo, Alessandro .
PHYSICAL REVIEW LETTERS, 2019, 122 (13)
[10]   State discrimination with postmeasurement information and incompatibility of quantum measurements [J].
Carmeli, Claudio ;
Heinosaari, Teiko ;
Toigo, Alessandro .
PHYSICAL REVIEW A, 2018, 98 (01)