Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gary J. Mooney

dblp:296/4974 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-3253-9815ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › experimental design
optimal experimental design
0.912025
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design · IEEE Trans. Inf. Theory 2025

Methods — techniques the papers use, named apart from their topics

tensor structure · 0.9condition number minimization · 0.9
YearPublicationVenuePosition
2025 A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design
abstract
Quantum process tomography is a critical task for characterizing the dynamics of quantum systems and achieving precise quantum control. In this paper, we propose a two-stage solution for both trace-preserving and non-trace-preserving quantum process tomography. Utilizing a tensor structure, our algorithm exhibits a computational complexity of$O(MLd^{2})$where d is the dimension of the quantum system and$M, L~(M\geq d^{2}, L\geq d^{2})$represent the numbers of different input states and measurement operators, respectively. We establish an analytical error upper bound and then design the optimal input states and the optimal measurement operators, which are both based on minimizing the error upper bound and maximizing the robustness characterized by the condition number. Numerical examples and testing on IBM quantum devices are presented to demonstrate the performance and efficiency of our algorithm.
Shuixin Xiao, Yuanlong Wang 0001, Jun Zhang 0090, Daoyi Dong, Gary J. Mooney, Ian R. Petersen, Hidehiro Yonezawa
IEEE Trans. Inf. Theory5