Searcharxiv⌕ Search

arXiv subjects

Le Bin Ho

Publications and source records attributed to Le Bin Ho.

At least 37 records · Page 2Linked to original sources

Flexible Genetic Algorithm for Quantum Support Vector Machines

Quantum Support Vector Machines (QSVM) is one of the most promising frameworks in quantum machine learning, yet their performance depends on the design of the feature map. Conventional approaches rely on fixed quantum circuits, which often fail to generalize across datasets. To address this limitation, we propose GA-QSVM, a hybrid framework that employs Genetic Algorithms (GA) to automatically optimize feature maps. The proposed method introduces a configurable framework that flexibly defines the evolutionary parameters, enabling the construction of adaptive circuits. Experimental evaluation of datasets, including Digits, Fashion, Wine, and Breast Cancer, demonstrates that GA-QSVMs achieve a comparable accuracy compared to classical SVMs and standard QSVMs. Furthermore, transfer learning results indicate that GA-QSVM's circuits generalize effectively across datasets. These findings highlight the potential of evolutionary strategies to automate and enhance kernel design for future quantum machine learning applications.

quant-ph↗

Optimized quantum sensor networks for ultralight dark matter detection

Dark matter (DM) remains one of the most compelling unresolved problems in fundamental physics, motivating the search for new detection approaches. We propose a network-based quantum sensor architecture to enhance sensitivity to ultralight DM fields. Each node in the network is a superconducting qubit, interconnected via controlled-Z gates in symmetric topologies such as line, ring, star, and fully connected graphs. We investigate four- and nine-qubit systems, optimizing both state preparation and measurement using a variational quantum metrology framework. This approach minimizes the quantum and classical Cramér-Rao bounds to identify optimal configurations. Bayesian inference is employed to extract the DM-induced phase shift from measurement outcomes. Our results show that optimized network configurations significantly outperform conventional GHZ-based protocols while maintaining shallow circuit depths compatible with noisy intermediate-scale quantum hardware. Sensitivity remains robust under local dephasing noise. These findings highlight the importance of network structure in quantum sensing and point toward scalable strategies for quantum-enhanced DM detection.

quant-ph↗

Statistical analysis of barren plateaus in variational quantum algorithms

We investigate the barren plateau (BP) phenomenon in variational quantum algorithms using a statistical approach. Using Gaussian function models, we identify three distinct types of BPs. The first type, which we called localized-dip BPs, occurs in landscapes that are mostly flat but contain a dip point where the gradient is large in a small region around the minimum. The second type, called localized-gorge BPs, which are somewhat similar to the localized-dip BPs but contain a gorge line. The third type, called everywhere-flat BPs, appears when the entire landscape is uniformly flat with almost vanishing gradients, making optimization significantly more difficult. After illustrating these behaviors in the Gaussian function models, we extend the analysis to the variational quantum eigensolver (VQE). We consider two types of ansätze: the hardware-efficient ansatz and the random Pauli ansatz. For both ansätze, we only observe the everywhere-flat BPs. Using our statistical approach, we searched for localized-dip and localized-gorge BPs but found no evidence of such features in the examples studied, suggesting that everywhere-flat BPs dominate in these ansätze. Our method effectively probes landscape features by capturing the gradient scaling across parameter space, making it a useful tool for diagnosing BPs in variational algorithms. To mitigate BPs in the VQE, we employ a genetic algorithm (GA) to optimize the random gates generated in the ansätze, thereby reshaping the cost function landscape to enhance the optimization efficiency. A comparison with an unoptimized ansatz shows how the ansatz design can improve the scalability and reliability of variational quantum algorithms.

quant-ph↗

Detecting and protecting entanglement through nonlocality, variational entanglement witness, and nonlocal measurements

We propose an innovative method to enhance the detection and protection of quantum entanglement, a cornerstone of quantum mechanics with applications in computing, communication, and beyond. While entanglement can be represented through nonlocal correlations detectable by the Clauser-Horne-Shimony-Holt (CHSH) inequality, this method does not fully capture all entangled states. To address this limitation, we introduce a variational entanglement witness (VEW) that optimizes the probabilities of detection and improves the efficiency of distinguishing between separable and entangled states. Additionally, we propose a novel nonlocal measurement framework that enables the assessment of both CHSH inequalities and the VEW while preserving the entanglement. Our approach enhances the reliability of entanglement detection while maintaining the entanglement of quantum states, offering significant advancements for quantum technologies.

quant-ph↗

Multi-target quantum compilation algorithm

Quantum compilation is the process of converting a target unitary operation into a trainable unitary represented by a quantum circuit. It has a wide range of applications, including gate optimization, quantum-assisted compiling, quantum state preparation, and quantum dynamic simulation. Traditional quantum compilation usually optimizes circuits for a single target. However, many quantum systems require simultaneous optimization of multiple targets, such as thermal state preparation, time-dependent dynamic simulation, and others. To address this, we develop a multi-target quantum compilation algorithm to improve the performance and flexibility of simulating multiple quantum systems. Our benchmarks and case studies demonstrate the effectiveness of the algorithm, highlighting the importance of multi-target optimization in advancing quantum computing. This work lays the groundwork for further development and evaluation of multi-target quantum compilation algorithms.

quant-ph↗

Harnessing graph state resources for robust quantum magnetometry under noise

Precise measurement of magnetic fields is essential for various applications, such as fundamental physics, space exploration, and biophysics. Although recent progress in quantum engineering has assisted in creating advanced quantum magnetometers, there are still ongoing challenges in improving their efficiency and noise resistance. This study focuses on using symmetric graph state resources for quantum magnetometry to enhance measurement precision by analyzing the estimation theory under time-homogeneous and time-inhomogeneous noise models. The results show a significant improvement in estimating both single and multiple Larmor frequencies. In single Larmor frequency estimation, the quantum Fisher information spans a spectrum from the standard quantum limit to the Heisenberg limit within a periodic range of the Larmor frequency, and in the case of multiple Larmor frequencies, it can exceed the standard quantum limit for both noisy cases. This study highlights the potential of graph state-based methods for improving magnetic field measurements under noisy environments.

quant-ph↗

Squeezing-induced quantum-enhanced multiphase estimation

We investigate how squeezing techniques can improve the measurement precision in multiphase quantum metrology. While these methods are well-studied and effectively used in single-phase estimations, their usage in multiphase situations has yet to be examined. We fill this gap by investigating the mechanism of quantum enhancement in the multiphase scenarios. Our analysis provides theoretical and numerical insights into the optimal condition for achieving the quantum Cramer-Rao bound, helping us understand the potential and mechanism for quantum-enhanced multiphase estimations with squeezing. This research opens up new possibilities for advancements in quantum metrology and sensing technologies.

quant-ph↗

Variational quantum metrology for multiparameter estimation under dephasing noise

We present a hybrid quantum-classical variational scheme to enhance precision in quantum metrology. In the scheme, both the initial state and the measurement basis in the quantum part are parameterized and optimized via the classical part. It enables the maximization of information gained about the measured quantity. We discuss specific applications to 3D magnetic field sensing under several dephasing noise modes. Indeed, we demonstrate its ability to simultaneously estimate all parameters and surpass the standard quantum limit, making it a powerful tool for metrological applications.

quant-ph↗

Variational preparation of entangled states on quantum computers

We propose a variational approach for preparing entangled quantum states on quantum computers. The methodology involves training a unitary operation to match with a target unitary using the Fubini-Study distance as a cost function. We employ various gradient-based optimization techniques to enhance performance, including Adam and quantum natural gradient. Our investigation showcases the versatility of different ansatzes featuring a hypergraph structure, enabling the preparation of diverse entanglement target states such as GHZ, W, and absolutely maximally entangled states. Remarkably, the circuit depth scales efficiently with the number of layers and does not depend on the number of qubits. Moreover, we explore the impacts of barren plateaus, readout noise, and error mitigation techniques on the proposed approach. Through our analysis, we demonstrate the effectiveness of the variational algorithm in maximizing the efficiency of quantum state preparation, leveraging low-depth quantum circuits.

quant-ph↗

Stochastic approach for quantum metrology with generic Hamiltonians

Recently, variational quantum metrology was proposed for Hamiltonians with multiplicative parameters, wherein the estimation precision can be optimized via variational circuits. However, systems with generic Hamiltonians still lack these variational schemes. This work introduces a quantum-circuit-based approach for studying quantum metrology with generic Hamiltonians. We present a time-dependent stochastic parameter-shift rule for the derivatives of evolved quantum states, whereby the quantum Fisher information can be obtained. The scheme can be executed in universal quantum computers under the family of parameterized gates. In magnetic field estimations, we demonstrate the consistency between the results obtained from the stochastic parameter-shift rule and the exact results, while the results obtained from a standard parameter-shift rule slightly deviate from the exact ones. Our work sheds light on studying quantum metrology with generic Hamiltonians using quantum circuit algorithms.

quant-ph↗

Quantum backaction effects in sequential measurements

Quantum backaction refers to the disturbance of a quantum system caused by measuring it. In sequential measurements, this effect can accumulate and become significant, leading to nontrivial modifications of the system state and the measurement results. This paper explores the ways in which quantum backaction can manifest in sequential measurements, including the role of measurement strength and the nature of the measurement process. The paper highlights the insight quantum foundation and the implications for quantum measurement and information processing.

quant-ph↗

Increased success probability in Hardy's nonlocality: Theory and demonstration

Depending on the way one measures, quantum nonlocality might manifest more visibly. Using basis transformations and interactions on a particle pair, Hardy logically argued that any local hidden variable theory leads to a paradox. Extended from the original work, we introduce a quantum nonlocal scheme for n-particle systems using two distinct approaches. First, a theoretical model is derived with analytical results for Hardy's nonlocality conditions and probability. Second, a quantum simulation using quantum circuits is constructed that matches very well to the analytical theory. When demonstrated on real quantum computers for n=3, we obtain reasonable results compared to theory. Even at macroscopic scales as n grows, the success probability asymptotes 15.6%, which is stronger than previous results.

quant-ph↗

No-go result for quantum postselection measurements of rank-m degenerate subspace

We present a no-go result for postselection measurements where the conditional expectation value of a joint system-device observable under postselection is nothing else than the conventional expectation value. Such a no-go result relies on the rank-m degenerate of the joint observable, where m is the dimension of the device subspace. Remarkable, we show that the error and disturbance in quantum measurements obey the no-go result, which implies that the error-disturbance uncertainty is unaffected under postselection measurements.

quant-ph↗

tqix.pis: A toolbox for quantum dynamics simulation of spin ensembles in Dicke basis

We introduce tqix.pis, a library of tqix, for quantum dynamics simulation of spin ensembles. The library emulates a dynamic process by a quantum circuit, including initializing a quantum state, executing quantum operators, and measuring the final state. It utilizes collective processes in spin ensembles to reduce the dimension from exponentially to quadratically with the number of particles, i.e., the quantum state spans in Dicke basis. It also facilitates the simulation time with multi-core processors and Graphics Processing Units. The library is thus applicable for the simulation of ensembles of large number of particles that have collective properties. Various phenomena, such as spin squeezing, variational quantum squeezing, quantum phase transition, and many-body quantum dynamics, can be simulated using the library.

quant-ph↗

Universal compilation for quantum state preparation and tomography

Universal compilation is a training process that compiles a trainable unitary into a target unitary and it serves vast potential applications from quantum dynamic simulations to optimal circuits with deep-compressing, device benchmarking, quantum error mitigation, and so on. Here, we propose a universal compilation-based variational algorithm for the preparation and tomography of quantum states in low-depth quantum circuits. We apply the Fubini-Study distance to be a trainable cost function under various gradient-based optimizers, including the quantum natural gradient approach. We evaluate the performance of various unitary topologies and the trainability of different optimizers for getting high efficiency. In practice, we address different circuit ansatzes in quantum state preparation, including the linear and graph-based ansatzes for preparing different entanglement target states such as representative GHZ and W states. We also discuss the effect of the circuit depth, barren plateau, readout noise in the model, and the error mitigation solution. We next evaluate the reconstructing efficiency in quantum state tomography via various popular circuit ansatzes and reveal the crucial role of the circuit depth in the robust fidelity. The results are comparable with the shadow tomography method, a similar fashion in the field. Our work expresses the adequate capacity of the universal compilation-based variational algorithm to maximize the efficiency in the quantum state preparation and tomography. Further, it promises applications in quantum metrology and sensing and is applicable in the near-term quantum computers for verification of the circuits fidelity and various quantum computing tasks.

quant-ph↗

Qsun: an open-source platform towards practical quantum machine learning applications

Currently, quantum hardware is restrained by noises and qubit numbers. Thus, a quantum virtual machine that simulates operations of a quantum computer on classical computers is a vital tool for developing and testing quantum algorithms before deploying them on real quantum computers. Various variational quantum algorithms have been proposed and tested on quantum virtual machines to surpass the limitations of quantum hardware. Our goal is to exploit further the variational quantum algorithms towards practical applications of quantum machine learning using state-of-the-art quantum computers. This paper first introduces our quantum virtual machine named Qsun, whose operation is underlined by quantum state wave-functions. The platform provides native tools supporting variational quantum algorithms. Especially using the parameter-shift rule, we implement quantum differentiable programming essential for gradient-based optimization. We then report two tests representative of quantum machine learning: quantum linear regression and quantum neural network.

quant-ph↗

Experimenting quantum phenomena on NISQ computers using high level quantum programming

We execute the quantum eraser, the Elitzur-Vaidman bomb, and the Hardy's paradox experiment using high-level programming language on a generic, gate-based superconducting quantum processor made publicly available by IBM. The quantum circuits for these experiments use a mixture of one-qubit and multi-qubit gates and require high entanglement gate accuracy. The results aligned with theoretical predictions of quantum mechanics to high confidence on circuits using up to 3 qubits. The power of quantum computers and high-level language as a platform for experimenting and studying quantum phenomena is henceforth demonstrated.

quant-ph↗

Error-disturbance uncertainty relations in Faraday measurements

We examine error-disturbance relations in the quantum measurement of spin systems using an atom-light interface scheme. We model a single spin-1/2 system that interacts with a polarized light meter via a Faraday interaction. We formulate the error and disturbance of the model and examine the uncertainty relations. We found that for the coherent light meter in pure polarization, both the error and disturbance behave the cyclic oscillations due to the Faraday rotation in both the light and spin polarizations. We also examine a class of polarization squeezed light meter, where we apply the phase-space approximation and characterize the role of squeezing. We derive error-disturbance relations for these cases and find that the Heisenberg-Arthurs-Kelly uncertainty is violated while the tight Branciard-Ozawa uncertainty always holds. We note that, in the limit of weak interaction strength, the error and disturbance become to obey the unbiasedness condition and hence the Heisenberg-Arthurs-Kelly relation holds. The work would contribute to our understanding of quantum measurement of spin systems under the atom-light interface framework, and may hold potential applications in quantum metrology, quantum state estimation and control.

quant-ph↗