Xuanqiang Zhao

ORCID: 0000-0002-6003-5489
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Quantum Computing Algorithms and Architecture
  • Quantum Information and Cryptography
  • Quantum Mechanics and Applications
  • Neural Networks and Reservoir Computing
  • Quantum and electron transport phenomena
  • Machine Learning in Materials Science
  • Quantum-Dot Cellular Automata
  • Advancements in Semiconductor Devices and Circuit Design
  • Anomaly Detection Techniques and Applications
  • Network Security and Intrusion Detection
  • Spectroscopy and Chemometric Analyses
  • Stochastic Gradient Optimization Techniques
  • Spectroscopy Techniques in Biomedical and Chemical Research
  • Quantum many-body systems
  • Model Reduction and Neural Networks
  • Laser-Matter Interactions and Applications
  • Internet Traffic Analysis and Secure E-voting
  • Spectroscopy and Quantum Chemical Studies
  • Molecular Communication and Nanonetworks

University of Hong Kong
2023-2025

Baidu (China)
2020-2023

University of California, San Diego
2020

Chongqing University of Posts and Telecommunications
2016

10.1007/s11432-023-3879-7 article EN Science China Information Sciences 2024-03-27

Estimating the difference between quantum data is crucial in computing. However, as typical characterizations of similarity, trace distance and fidelity are believed to be exponentially-hard evaluate general. In this work, we introduce hybrid quantum-classical algorithms for these two measures on near-term devices where no assumption input state required. First, Variational Trace Distance Estimation (VTDE) algorithm. We particular provide technique extract desired spectrum information any...

10.1088/2058-9565/ac38ba article EN Quantum Science and Technology 2021-11-11

Abstract Quantum entanglement is a key resource in quantum technology, and its quantification vital task the current noisy intermediate-scale (NISQ) era. This paper combines hybrid quantum-classical computation quasi-probability decomposition to propose two variational algorithms, called detection (VED) logarithmic negativity estimation (VLNE), for detecting quantifying on near-term devices, respectively. VED makes use of positive map criterion works as follows. Firstly, it decomposes into...

10.1038/s41534-022-00556-w article EN cc-by npj Quantum Information 2022-05-09

The manipulation of quantum states through linear maps beyond operations has many important applications in various areas information processing. Current methods simulate unphysical by sampling physical according to classically determined probability distributions. In this work, we show that using measurement instead leads lower simulation costs for general Hermitian-preserving maps. Remarkably, establish the equality between cost and well-known diamond norm, thus closing a previously known...

10.1103/physrevresearch.7.013334 article EN cc-by Physical Review Research 2025-03-31

Abstract Distributed quantum information processing is essential for building networks and enabling more extensive computations. In this regime, several spatially separated parties share a multipartite system, the most natural set of operations Local Operations Classical Communication (LOCC). As pivotal part in theory practice, LOCC has led to many vital protocols such as teleportation. However, designing practical challenging due LOCC’s intractable structure limitations by near-term...

10.1038/s41534-021-00496-x article EN cc-by npj Quantum Information 2021-11-04

Unitary transformations formulate the time evolution of quantum states. How to learn a unitary transformation efficiently is fundamental problem in machine learning. The most natural and leading strategy train learning model based on dataset. Although presence more training data results better models, using too much reduces efficiency training. In this work, we solve minimum size sufficient datasets for exactly, which reveals power limitation data. First, prove that dataset with pure states...

10.1103/physrevapplied.19.034017 article EN Physical Review Applied 2023-03-06

Accurately estimating high-order moments of quantum states is an elementary precondition for many crucial tasks in computing, such as entanglement spectroscopy, entropy estimation, spectrum and predicting nonlinear features from states. But reality, inevitable noise prevents us accessing the desired value. In this paper, we address issue by systematically analyzing feasibility efficiency extracting noisy We first show that there exists a protocol capable accomplishing task if only underlying...

10.1103/prxquantum.5.020357 article EN cc-by PRX Quantum 2024-06-12

Weak values of quantum observables are a powerful tool for investigating phenomena. Some methods measuring weak in the laboratory require interactions and postselection, while others deterministic, but statistics over number experiments that grows linearly with dimension measured system worst case all possible observables. Here we propose deterministic dimension-independent scheme estimating arbitrary The is based on controlled operations associates states mathematical expression value to...

10.1103/physrevresearch.6.043043 article EN cc-by Physical Review Research 2024-10-17

An emerging direction of quantum computing is to establish meaningful applications in various fields artificial intelligence, including natural language processing (NLP). Although some efforts based on syntactic analysis have opened the door research Quantum NLP (QNLP), limitations such as heavy preprocessing and syntax-dependent network architecture make them impracticable larger real-world data sets. In this paper, we propose a new simple architecture, called self-attention neural (QSANN),...

10.48550/arxiv.2205.05625 preprint EN cc-by arXiv (Cornell University) 2022-01-01

Variational quantum algorithms have been acknowledged as a leading strategy to realize near-term advantages in meaningful tasks, including machine learning and combinatorial optimization. When applied tasks involving classical data, such generally begin with circuits for data encoding then train neural networks (QNNs) minimize target functions. Although QNNs widely studied improve these algorithms' performance on practical there is gap systematically understanding the influence of eventual...

10.48550/arxiv.2206.08273 preprint EN cc-by arXiv (Cornell University) 2022-01-01

Extracting classical information from quantum systems is an essential step of many algorithms. However, this could be corrupted as the are prone to noises, and its distortion under dynamics has not been adequately investigated. In work, we introduce a systematic framework study how well can retrieve noisy states. Given channel, fully characterize range recoverable information. This condition allows natural measure quantifying recoverability channel. Moreover, resolve minimum retrieving cost,...

10.22331/q-2023-04-13-978 article EN cc-by Quantum 2023-04-13

We introduce the task of shadow process simulation, where goal is to simulate estimation expectation values arbitrary quantum observables at output a target physical process. When sender and receiver share random bits or other no-signaling resources, we show that performance simulation exceeds conventional protocols in variety scenarios including communication, noise data compression. Remarkably, find there exist provides increased statistical accuracy without any increase number required samples.

10.1103/physrevlett.133.120804 article EN Physical Review Letters 2024-09-19

The spectral resolution of broadband Fourier-transform coherent anti-Stokes Raman spectroscopy is limited by the maximum optical path length difference that can be scanned within a short time in an interferometer. However, alternatives to exist which bypass this limitation with certain assumptions. We apply one such approach using interferometers delay line (low Fourier resolution) and large (high resolution). With method, we demonstrate closely spaced vibrational bands possible...

10.1364/ol.388624 article EN publisher-specific-oa Optics Letters 2020-02-03

Quantum computing, as an emerging computing paradigm, is expected to tackle problems such quantum chemistry, optimization, information security, and artificial intelligence, which are intractable with using classical computing. hardware software continue develop rapidly, but they not realize universal computation in the next few years. Therefore, use of solve practical near term has become a hot topic field Exploration applications near-term great significance understanding capability...

10.7498/aps.70.20210985 article EN Acta Physica Sinica 2021-01-01

Quantum entanglement is a key resource in quantum technology, and its quantification vital task the current Noisy Intermediate-Scale (NISQ) era. This paper combines hybrid quantum-classical computation quasi-probability decomposition to propose two variational algorithms, called Variational Entanglement Detection (VED) Logarithmic Negativity Estimation (VLNE), for detecting quantifying on near-term devices, respectively. VED makes use of positive map criterion works as follows. Firstly, it...

10.48550/arxiv.2012.14311 preprint EN cc-by arXiv (Cornell University) 2020-01-01

Most traditional network anomalies and attacks detection systems tend to employ supervised strategies, which require labeled training dataset that is arduous expensive obtain fails detect unknown jeopardizing the system security reliability. In this paper we present a new unsupervised approach based on abnormality weights rendering subspace clustering techniques without previously traffic or signatures. order examine capability of proposed approach, conducted several experiments both real...

10.1109/icist.2016.7483462 article EN 2016-05-01

We introduce the task of shadow process simulation, where goal is to reproduce expectation values arbitrary quantum observables at output a target physical process. When sender and receiver share classical random bits, we show that performance simulation exceeds conventional protocols in variety scenarios including communication, noise data compression. Remarkably, provides increased accuracy without any increase sampling cost. Overall, unified framework for protocols, probabilistic error...

10.48550/arxiv.2401.14934 preprint EN arXiv (Cornell University) 2024-01-26

Understanding the classical communication cost of simulating a quantum channel is fundamental problem in information theory, which becomes even more intriguing when considering role non-locality processing. This paper investigates bidirectional bipartite assisted by non-signalling correlations. Such correlations are permitted not only across spatial dimension between two parties but also along temporal simulation protocol. By introducing superchannels, we derive semidefinite programming...

10.48550/arxiv.2408.02506 preprint EN arXiv (Cornell University) 2024-08-05

The manipulation of quantum states through linear maps beyond operations has many important applications in various areas information processing. Current methods simulate unphysical by sampling physical operations, but a classical way. In this work, we show that using measurement place leads to lower simulation costs for general Hermitian-preserving maps. Remarkably, establish the equality between cost and well-known diamond norm, thus closing previously known gap assigning norm universal...

10.48550/arxiv.2309.09963 preprint EN cc-by arXiv (Cornell University) 2023-01-01

Accurately estimating high-order moments of quantum states is an elementary precondition for many crucial tasks in computing, such as entanglement spectroscopy, entropy estimation, spectrum estimation and predicting non-linear features from states. But reality, inevitable noise prevents us accessing the desired value. In this paper, we address issue by systematically analyzing feasibility efficiency extracting noisy We first show that there exists a protocol capable accomplishing task if...

10.48550/arxiv.2309.11403 preprint EN cc-by arXiv (Cornell University) 2023-01-01

Weak values of quantum observables are a powerful tool for investigating broad spectrum phenomena. For this reason, several methods to measure them in the laboratory have been proposed. Some these require weak interactions and postselection, while others deterministic, but statistics over number experiments growing exponentially with measured particles. Here we propose deterministic dimension-independent scheme estimating arbitrary observables. The scheme, based on coherently controlled SWAP...

10.48550/arxiv.2311.03941 preprint EN cc-by arXiv (Cornell University) 2023-01-01

Unitary transformations formulate the time evolution of quantum states. How to learn a unitary transformation efficiently is fundamental problem in machine learning. The most natural and leading strategy train learning model based on dataset. Although presence more training data results better models, using too much reduces efficiency training. In this work, we solve minimum size sufficient datasets for exactly, which reveals power limitation data. First, prove that dataset with pure states...

10.48550/arxiv.2203.00546 preprint EN cc-by arXiv (Cornell University) 2022-01-01

Extracting classical information from quantum systems is an essential step of many algorithms. However, this could be corrupted as the are prone to noises, and its distortion under dynamics has not been adequately investigated. In work, we introduce a systematic framework study how well can retrieve noisy states. Given channel, fully characterize range recoverable information. This condition allows natural measure quantifying recoverability channel. Moreover, resolve minimum retrieving cost,...

10.48550/arxiv.2203.04862 preprint EN cc-by arXiv (Cornell University) 2022-01-01
Coming Soon ...