Quantum Hamiltonian Identifiability via a Similarity Transformation Approach and Beyond
arXiv:1809.02965 · doi:10.1109/TAC.2020.2973582
Abstract
The identifiability of a system is concerned with whether the unknown parameters in the system can be uniquely determined with all the possible data generated by a certain experimental setting. A test of quantum Hamiltonian identifiability is an important tool to save time and cost when exploring the identification capability of quantum probes and experimentally implementing quantum identification schemes. In this paper, we generalize the identifiability test based on the Similarity Transformation Approach (STA) in classical control theory and extend it to the domain of quantum Hamiltonian identification. We employ STA to prove the identifiability of spin-1/2 chain systems with arbitrary dimension assisted by single-qubit probes. We further extend the traditional STA method by proposing a Structure Preserving Transformation (SPT) method for non-minimal systems. We use the SPT method to introduce an indicator for the existence of economic quantum Hamiltonian identification algorithms, whose computational complexity directly depends on the number of unknown parameters (which could be much smaller than the system dimension). Finally, we give an example of such an economic Hamiltonian identification algorithm and perform simulations to demonstrate its effectiveness.
arXiv comment14 pages, 2 figures
References in corpus (25)
- Quantum sensing
- Experimental Quantum State Tomography of Optical Fields and Ultrafast Statistical Sampling
- Unknown Quantum States and Operations, a Bayesian View
- Experimental Quantum Hamiltonian Learning
- Quantum Hamiltonian identification from measurement time traces
- Recursively Adaptive Quantum State Tomography: Theory and Two-qubit Experiment
- Coupling strength estimation for spin chains despite restricted access
- Full reconstruction of a 14-qubit state within four hours
- Hamiltonian tomography in an access-limited setting without state initialization
- A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
- Quantum System Identification
- Indirect Hamiltonian Identification through a small gateway
- Hamiltonian identifiability assisted by single-probe measurement
- Identifying Strong-Field Effects in Indirect Photofragmentation Reactions
- System identification for passive linear quantum systems
- Identification of open quantum systems from observable time traces
- Scheme for direct measurement of a general two-qubit Hamiltonian
- Structure identification and state initialization of spin networks with limited access
- Evolution-free Hamiltonian parameter estimation through Zeeman markers
- Exact dimension estimation of interacting qubit systems assisted by a single quantum probe
- Quantifying precision loss in local quantum thermometry via diagonal discord
- Hamiltonian identification through enhanced observability utilizing quantum control
- Power Spectrum Identification for Quantum Linear Systems
- Identification of single-input-single-output quantum linear systems
- Bypassing state initialization in Hamiltonian tomography on spin-chains
Cited by in corpus (5)
- Variational Quantum Algorithm for Estimating the Quantum Fisher Information
- Two-stage Estimation for Quantum Detector Tomography: Error Analysis, Numerical and Experimental Results
- Quantum Hamiltonian Identification with Classical Colored Measurement Noise
- On the capability of a class of quantum sensors
- Topology identification of autonomous quantum dynamical networks