arXiv subjects

Yuanlong Wang

Publications and source records attributed to Yuanlong Wang.

32 records · Page 2Linked to original sources

arXiv2023

On the regularization and optimization in quantum detector tomography

Quantum detector tomography (QDT) is a fundamental technique for calibrating quantum devices and performing quantum engineering tasks. In this paper, we utilize regularization to improve the QDT accuracy whenever the probe states are informationally complete or informationally incomplete. In the informationally complete scenario, without regularization, we optimize the resource (probe state) distribution by converting it to a semidefinite programming problem. Then in both the informationally complete and informationally incomplete scenarios, we discuss different regularization forms and prove the mean squared error scales as $ O(\frac{1}{N}) $ or tends to a constant with $ N $ state copies under the static assumption. We also characterize the ideal best regularization for the identifiable parameters, accounting for both the informationally complete and informationally incomplete scenarios. Numerical examples demonstrate the effectiveness of different regularization forms and a quantum optical experiment test shows that a suitable regularization form can reach a reduced mean squared error.

quant-ph↗

arXiv2022

On compression rate of quantum autoencoders: Control design, numerical and experimental realization

Quantum autoencoders which aim at compressing quantum information in a low-dimensional latent space lie in the heart of automatic data compression in the field of quantum information. In this paper, we establish an upper bound of the compression rate for a given quantum autoencoder and present a learning control approach for training the autoencoder to achieve the maximal compression rate. The upper bound of the compression rate is theoretically proven using eigen-decomposition and matrix differentiation, which is determined by the eigenvalues of the density matrix representation of the input states. Numerical results on 2-qubit and 3-qubit systems are presented to demonstrate how to train the quantum autoencoder to achieve the theoretically maximal compression, and the training performance using different machine learning algorithms is compared. Experimental results of a quantum autoencoder using quantum optical systems are illustrated for compressing two 2-qubit states into two 1-qubit states.

quant-ph↗

arXiv2022

Optimal and two-step adaptive quantum detector tomography

Quantum detector tomography is a fundamental technique for calibrating quantum devices and performing quantum engineering tasks. In this paper, we design optimal probe states for detector estimation based on the minimum upper bound of the mean squared error (UMSE) and the maximum robustness. We establish the minimum UMSE and the minimum condition number for quantum detectors and provide concrete examples that can achieve optimal detector tomography. In order to enhance the estimation precision, we also propose a two-step adaptive detector tomography algorithm to optimize the probe states adaptively based on a modified fidelity index. We present a sufficient condition on when the estimation error of our two-step strategy scales inversely proportional to the number of state copies. Moreover, the superposition of coherent states is used as probe states for quantum detector tomography and the estimation error is analyzed. Numerical results demonstrate the effectiveness of both the proposed optimal and adaptive quantum detector tomography methods.

quant-ph↗

arXiv2021

Certified Random Number Generation from Quantum Steering

The ultimate random number generators are those certified to be unpredictable -- including to an adversary. The use of simple quantum processes promises to provide numbers that no physical observer could predict but, in practice, unwanted noise and imperfect devices can compromise fundamental randomness and protocol security. Certified randomness protocols have been developed which remove the need for trust in devices by taking advantage of nonlocality. Here, we use a photonic platform to implement our protocol, which operates in the quantum steering scenario where one can certify randomness in a one-sided device independent framework. We demonstrate an approach for a steering-based generator of public or private randomness, and the first generation of certified random bits, with the detection loophole closed, in the steering scenario.

quant-ph↗

arXiv2021

Frame-Based Filter-Function Formalism for Quantum Characterization and Control

We introduce a theoretical framework for resource-efficient characterization and control of non-Markovian open quantum systems, which naturally allows for the integration of given, experimentally motivated, control capabilities and constraints. This is achieved by developing a transfer filter-function formalism based on the general notion of a frame and by appropriately tying the choice of frame to the available control. While recovering the standard frequency-based filter-function formalism as a special instance, this control-adapted generalization affords intrinsic flexibility and, crucially, it permits an efficient representation of the relevant control matrix elements and dynamical integrals if an appropriate finite-size frame condition is obeyed. Our frame-based formulation overcomes important limitations of existing approaches. In particular, we show how to implement quantum noise spectroscopy in the presence of nonstationary noise sources, and how to effectively achieve control-driven model reduction for noise-optimized prediction and quantum gate design.

quant-ph↗

arXiv2021

Two-stage Estimation for Quantum Detector Tomography: Error Analysis, Numerical and Experimental Results

Quantum detector tomography is a fundamental technique for calibrating quantum devices and performing quantum engineering tasks. In this paper, a novel quantum detector tomography method is proposed. First, a series of different probe states are used to generate measurement data. Then, using constrained linear regression estimation, a stage-1 estimation of the detector is obtained. Finally, the positive semidefinite requirement is added to guarantee a physical stage-2 estimation. This Two-stage Estimation (TSE) method has computational complexity $O(nd^2M)$, where $n$ is the number of $d$-dimensional detector matrices and $M$ is the number of different probe states. An error upper bound is established, and optimization on the coherent probe states is investigated. We perform simulation and a quantum optical experiment to testify the effectiveness of the TSE method.

quant-ph↗

arXiv2020

Generation of accessible sets in the dynamical modelling of quantum network systems

In this paper, we consider the dynamical modeling of a class of quantum network systems consisting of qubits. Qubit probes are employed to measure a set of selected nodes of the quantum network systems. For a variety of applications, a state space model is a useful way to model the system dynamics. To construct a state space model for a quantum network system, the major task is to find an accessible set containing all of the operators coupled to the measurement operators. This paper focuses on the generation of a proper accessible set for a given system and measurement scheme. We provide analytic results on simplifying the process of generating accessible sets for systems with a time-independent Hamiltonian. Since the order of elements in the accessible set determines the form of state space matrices, guidance is provided to effectively arrange the ordering of elements in the state vector. Defining a system state according to the accessible set, one can develop a state space model with a special pattern inherited from the system structure. As a demonstration, we specifically consider a typical 1D-chain system with several common measurements, and employ the proposed method to determine its accessible set.

eess.SY↗

arXiv2020

On the capability of a class of quantum sensors

Quantum sensors may provide extremely high sensitivity and precision to extract key information in a quantum or classical physical system. A fundamental question is whether a quantum sensor is capable of uniquely inferring unknown parameters in a system for a given structure of the quantum sensor and admissible measurement on the sensor. In this paper, we investigate the capability of a class of quantum sensors which consist of either a single qubit or two qubits. A quantum sensor is coupled to a spin chain system to extract information of unknown parameters in the system. With given initialisation and measurement schemes, we employ the similarity transformation approach and the Grobner basis method to prove that a single-qubit quantum sensor cannot effectively estimate the unknown parameters in the spin chain system while the two-qubit quantum sensor can. The work demonstrates that it is a feasible method to enhance the capability of quantum sensors by increasing the number of qubits in the quantum sensors for some practical applications.

quant-ph↗

arXiv2018

Quantum Hamiltonian Identifiability via a Similarity Transformation Approach and Beyond

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.

quant-ph↗

arXiv2018

Several recent developments in estimation and robust control of quantum systems

This paper summarizes several recent developments in the area of estimation and robust control of quantum systems and outlines several directions for future research. Quantum state tomography via linear regression estimation and adaptive quantum state estimation are introduced and a Hamiltonian identification algorithm is outlined. Two quantum robust control approaches including sliding mode control and sampling-based learning control are illustrated.

eess.SY↗

arXiv2017

Quantum gate identification: error analysis, numerical results and optical experiment

The identification of an unknown quantum gate is a significant issue in quantum technology. In this paper, we propose a quantum gate identification method within the framework of quantum process tomography. In this method, a series of pure states are inputted to the gate and then a fast state tomography on the output states is performed and the data are used to reconstruct the quantum gate. Our algorithm has computational complexity $O(d^3)$ with the system dimension $d$. The algorithm is compared with maximum likelihood estimation method for the running time, which shows the efficiency advantage of our method. An error upper bound is established for the identification algorithm and the robustness of the algorithm against the purity of input states is also tested. We perform quantum optical experiment on single-qubit Hadamard gate to verify the effectiveness of the identification algorithm.

quant-ph↗

arXiv2016

A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis

Quantum Hamiltonian identification is important for characterizing the dynamics of quantum systems, calibrating quantum devices and achieving precise quantum control. In this paper, an effective two-step optimization (TSO) quantum Hamiltonian identification algorithm is developed within the framework of quantum process tomography. In the identification method, different probe states are inputted into quantum systems and the output states are estimated using the quantum state tomography protocol via linear regression estimation. The time-independent system Hamiltonian is reconstructed based on the experimental data for the output states. The Hamiltonian identification method has computational complexity O(d^6) where d is the dimension of the system Hamiltonian. An error upper bound O(d^3/N^(1/2))$ is also established, where N is the resource number for the tomography of each output state, and several numerical examples demonstrate the effectiveness of the proposed TSO Hamiltonian identification method.

quant-ph↗

arXiv2016

Full reconstruction of a 14-qubit state within four hours

Full quantum state tomography (FQST) plays a unique role in the estimation of the state of a quantum system without \emph{a priori} knowledge or assumptions. Unfortunately, since FQST requires informationally (over)complete measurements, both the number of measurement bases and the computational complexity of data processing suffer an exponential growth with the size of the quantum system. A 14-qubit entangled state has already been experimentally prepared in an ion trap, and the data processing capability for FQST of a 14-qubit state seems to be far away from practical applications. In this paper, the computational capability of FQST is pushed forward to reconstruct a 14-qubit state with a run time of only 3.35 hours using the linear regression estimation (LRE) algorithm, even when informationally overcomplete Pauli measurements are employed. The computational complexity of the LRE algorithm is first reduced from $O(10^{19})$ to $O(10^{15})$ for a 14-qubit state, by dropping all the zero elements, and its computational efficiency is further sped up by fully exploiting the parallelism of the LRE algorithm with parallel Graphic Processing Unit (GPU) programming. Our result can play an important role in quantum information technologies with large quantum systems.

quant-ph↗

arXiv2015

Recursively Adaptive Quantum State Tomography: Theory and Two-qubit Experiment

Adaptive techniques have important potential for wide applications in enhancing precision of quantum parameter estimation. We present a recursively adaptive quantum state tomography (RAQST) protocol for finite dimensional quantum systems and experimentally implement the adaptive tomography protocol on two-qubit systems. In this RAQST protocol, an adaptive measurement strategy and a recursive linear regression estimation algorithm are performed. Numerical results show that our RAQST protocol can outperform the tomography protocols using mutually unbiased bases (MUB) and the two-stage MUB adaptive strategy even with the simplest product measurements. When nonlocal measurements are available, our RAQST can beat the Gill-Massar bound for a wide range of quantum states with a modest number of copies. We use only the simplest product measurements to implement two-qubit tomography experiments. In the experiments, we use error-compensation techniques to tackle systematic error due to misalignments and imperfection of wave plates, and achieve about 100-fold reduction of the systematic error. The experimental results demonstrate that the improvement of RAQST over nonadaptive tomography is significant for states with a high level of purity. Our results also show that this recursively adaptive tomography method is particularly effective for the reconstruction of maximally entangled states, which are important resources in quantum information.

quant-ph↗