scholarly journals Experimental proposal for symmetric minimal two-qubit state tomography

2012 ◽  
Vol 85 (5) ◽  
Author(s):  
Amir Kalev ◽  
Jiangwei Shang ◽  
Berthold-Georg Englert
Keyword(s):  
2017 ◽  
Vol 19 (3) ◽  
pp. 033036 ◽  
Author(s):  
Lupei Qin ◽  
Luting Xu ◽  
Wei Feng ◽  
Xin-Qi Li

2012 ◽  
Vol 14 (8) ◽  
pp. 085005 ◽  
Author(s):  
Takanori Sugiyama ◽  
Peter S Turner ◽  
Mio Murao

2017 ◽  
Vol 110 (13) ◽  
pp. 132602
Author(s):  
Mengmeng Li ◽  
Guangming Xue ◽  
Xinsheng Tan ◽  
Qiang Liu ◽  
Kunzhe Dai ◽  
...  

2016 ◽  
Vol 2 (1) ◽  
Author(s):  
Zhibo Hou ◽  
Huangjun Zhu ◽  
Guo-Yong Xiang ◽  
Chuan-Feng Li ◽  
Guang-Can Guo

2009 ◽  
Vol 102 (20) ◽  
Author(s):  
S. Filipp ◽  
P. Maurer ◽  
P. J. Leek ◽  
M. Baur ◽  
R. Bianchetti ◽  
...  
Keyword(s):  

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 20942-20953
Author(s):  
Ying-Jia Qian ◽  
Zhi-Hang Xu ◽  
Shi-Bei Xue ◽  
Min Jiang

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Yihui Quek ◽  
Stanislav Fort ◽  
Hui Khoon Ng

AbstractCurrent algorithms for quantum state tomography (QST) are costly both on the experimental front, requiring measurement of many copies of the state, and on the classical computational front, needing a long time to analyze the gathered data. Here, we introduce neural adaptive quantum state tomography (NAQT), a fast, flexible machine-learning-based algorithm for QST that adapts measurements and provides orders of magnitude faster processing while retaining state-of-the-art reconstruction accuracy. As in other adaptive QST schemes, measurement adaptation makes use of the information gathered from previous measured copies of the state to perform a targeted sensing of the next copy, maximizing the information gathered from that next copy. Our NAQT approach allows for a rapid and seamless integration of measurement adaptation and statistical inference, using a neural-network replacement of the standard Bayes’ update, to obtain the best estimate of the state. Our algorithm, which falls into the machine learning subfield of “meta-learning” (in effect “learning to learn” about quantum states), does not require any ansatz about the form of the state to be estimated. Despite this generality, it can be retrained within hours on a single laptop for a two-qubit situation, which suggests a feasible time-cost when extended to larger systems and potential speed-ups if provided with additional structure, such as a state ansatz.


2010 ◽  
Vol 08 (01n02) ◽  
pp. 325-335 ◽  
Author(s):  
HARALD WUNDERLICH ◽  
MARTIN B. PLENIO

Many experiments in quantum information aim at creating graph states. Quantifying the purity of an experimentally achieved graph state could in principle be accomplished using full-state tomography. This method requires a number of measurement settings growing exponentially with the number of constituents involved. Thus, full-state tomography becomes experimentally infeasible even for a moderate number of qubits. In this paper, we present a method to estimate the purity of experimentally achieved graph states with simple measurements. The observables we consider are the stabilizers of the underlying graph. Then, we formulate the problem as: "What is the state with the least purity that is compatible with the measurement data?" We solve this problem analytically and compare the obtained bounds with results from full-state tomography for simulated data.


Sign in / Sign up

Export Citation Format

Share Document