ترغب بنشر مسار تعليمي؟ اضغط هنا

Objective Compressive Quantum Process Tomography

275   0   0.0 ( 0 )
 نشر من قبل Yong Siah Teo
 تاريخ النشر 2019
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We present a compressive quantum process tomography scheme that fully characterizes any rank-deficient completely-positive process with no a priori information about the process apart from the dimension of the system on which the process acts. It uses randomly-chosen input states and adaptive output von Neumann measurements. Both entangled and tensor-product configurations are flexibly employable in our scheme, the latter which naturally makes it especially compatible with many-body quantum computing. Two main features of this scheme are the certification protocol that verifies whether the accumulated data uniquely characterize the quantum process, and a compressive reconstruction method for the output states. We emulate multipartite scenarios with high-order electromagnetic transverse modes and optical fibers to positively demonstrate that, in terms of measurement resources, our assumption-free compressive strategy can reconstruct quantum processes almost equally efficiently using all types of input states and basis measurement operations, operations, independent of whether or not they are factorizable into tensor-product states.



قيم البحث

اقرأ أيضاً

This review serves as a concise introductory survey of modern compressive tomography developed since 2019. These are schemes meant for characterizing arbitrary low-rank quantum objects, be it an unknown state, a process or detector, using minimal mea suring resources (hence compressive) without any emph{a priori} assumptions (rank, sparsity, eigenbasis, emph{etc}.) about the quantum object. This article contains a reasonable amount of technical details for the quantum-information community to start applying the methods discussed here. To facilitate the understanding of formulation logic and physics of compressive tomography, the theoretical concepts and important numerical results (both new and cross-referenced) shall be presented in a pedagogical manner.
Quantum process tomography is an experimental technique to fully characterize an unknown quantum process. Standard quantum process tomography suffers from exponentially scaling of the number of measurements with the increasing system size. In this wo rk, we put forward a quantum machine learning algorithm which approximately encodes the unknown unitary quantum process into a relatively shallow depth parametric quantum circuit. We demonstrate our method by reconstructing the unitary quantum processes resulting from the quantum Hamiltonian evolution and random quantum circuits up to $8$ qubits. Results show that those quantum processes could be reconstructed with high fidelity, while the number of input states required are at least $2$ orders of magnitude less than required by the standard quantum process tomography.
Quantum process tomography is a necessary tool for verifying quantum gates and diagnosing faults in architectures and gate design. We show that the standard approach of process tomography is grossly inaccurate in the case where the states and measure ment operators used to interrogate the system are generated by gates that have some systematic error, a situation all but unavoidable in any practical setting. These errors in tomography can not be fully corrected through oversampling or by performing a larger set of experiments. We present an alternative method for tomography to reconstruct an entire library of gates in a self-consistent manner. The essential ingredient is to define a likelihood function that assumes nothing about the gates used for preparation and measurement. In order to make the resulting optimization tractable we linearize about the target, a reasonable approximation when benchmarking a quantum computer as opposed to probing a black-box function.
Characterisation protocols have so far played a central role in the development of noisy intermediate-scale quantum (NISQ) computers capable of impressive quantum feats. This trajectory is expected to continue in building the next generation of devic es: ones that can surpass classical computers for particular tasks -- but progress in characterisation must keep up with the complexities of intricate device noise. A missing piece in the zoo of characterisation procedures is tomography which can completely describe non-Markovian dynamics. Here, we formally introduce a generalisation of quantum process tomography, which we call process tensor tomography. We detail the experimental requirements, construct the necessary post-processing algorithms for maximum-likelihood estimation, outline the best-practice aspects for accurate results, and make the procedure efficient for low-memory processes. The characterisation is the pathway to diagnostics and informed control of correlated noise. As an example application of the technique, we improve multi-time circuit fidelities on IBM Quantum devices for both standalone qubits and in the presence of crosstalk to a level comparable with the fault-tolerant noise threshold in a variety of different noise conditions. Our methods could form the core for carefully developed software that may help hardware consistently pass the fault-tolerant noise threshold.
We study the number of measurements required for quantum process tomography under prior information, such as a promise that the unknown channel is unitary. We introduce the notion of an interactive observable and we show that any unitary channel acti ng on a $d$-level quantum system can be uniquely identified among all other channels (unitary or otherwise) with only $O(d^2)$ interactive observables, as opposed to the $O(d^4)$ required for tomography of arbitrary channels. This result generalizes, so that channels with at most $q$ Kraus operators can be identified with only $O(qd^2)$ interactive observables. Slight improvements can be obtained if we wish to identify such a channel only among unital channels or among other channels with $q$ Kraus operators. These results are proven via explicit construction of large subspaces of Hermitian matrices with various conditions on rank, eigenvalues, and partial trace. Our constructions are built upon various forms of totally nonsingular matrices.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا