arXiv subjects

Shi-Yao Hou

Publications and source records attributed to Shi-Yao Hou.

17 recordsLinked to original sources

arXiv2026

Impact of Oxygen Vacancies in Josephson Junction on Decoherence of Superconducting Qubits

Superconducting quantum circuits are promising platforms for scalable quantum computing, where qubit coherence is critically determined by microscopic defects in the oxide tunneling barrier of Josephson junctions. Amorphous Al$_2$O$_3$ is widely used as a barrier material, but under irradiation, oxygen vacancy (V$_O$) defects are readily generated, introducing noise sources that accelerate qubit decoherence. We systematically investigate the structural characteristics and electronic impact of V$_O$ defects in amorphous Al$_2$O$_3$ using first-principles calculations and \textit{ab initio} molecular dynamics. Our results show that both the coordination environment and concentration of V$_O$s strongly influence electrical conductivity. In particular, two- and three-coordinated V$_O$s, unique to the amorphous structure, enhance conductivity more than conventional four-coordinated vacancies. Increasing V$_O$ concentration amplifies conductivity fluctuations, which we link to critical current noise in Josephson junctions. Using a noise model, we estimate that higher V$_O$ densities lead to shorter qubit coherence times. These findings provide insights for radiation-hard design of superconducting quantum devices.

quant-ph↗

arXiv2024

Application of Large Language Models to Quantum State Simulation

Quantum computers leverage the unique advantages of quantum mechanics to achieve acceleration over classical computers for certain problems. Currently, various quantum simulators provide powerful tools for researchers, but simulating quantum evolution with these simulators often incurs high time costs. Additionally, resource consumption grows exponentially as the number of quantum bits increases. To address this issue, our research aims to utilize Large Language Models (LLMs) to simulate quantum circuits. This paper details the process of constructing 1-qubit and 2-qubit quantum simulator models, extending to multiple qubits, and ultimately implementing a 3-qubit example. Our study demonstrates that LLMs can effectively learn and predict the evolution patterns among quantum bits, with minimal error compared to the theoretical output states. Even when dealing with quantum circuits comprising an exponential number of quantum gates, LLMs remain computationally efficient. Overall, our results highlight the potential of LLMs to predict the outputs of complex quantum dynamics, achieving speeds far surpassing those required to run the same process on a quantum computer. This finding provides new insights and tools for applying machine learning methods in the field of quantum computing.

quant-ph↗

arXiv2024

From Computing to Quantum Mechanics: Accessible and Hands-On Quantum Computing Education for High School Students

This paper outlines an alternative approach to teaching quantum computing at the high school level, tailored for students with limited prior knowledge in advanced mathematics and physics. This approach diverges from traditional methods by building upon foundational concepts in classical computing before gradually introducing quantum mechanics, thereby simplifying the entry into this complex field. The course was initially implemented in a program for gifted high school students under the Hong Kong Education Bureau and received encouraging feedback, indicating its potential effectiveness for a broader student audience. A key element of this approach is the practical application through portable NMR quantum computers, which provides students with hands-on experience. The paper describes the structure of the course, including the organization of the lectures, the integration of the hardware of the portable nuclear magnetic resonance (NMR) quantum computers, the Gemini/Triangulum series, and detailed lecture notes in an appendix. The initial success in the specialized program and ongoing discussions to expand the course to regular high schools in Hong Kong and Shenzhen suggest the viability of this approach for wider educational application. By focusing on accessibility and student engagement, this approach presents a valuable perspective on introducing quantum computing concepts at the high school level, aiming to enhance student understanding and interest in the field.

physics.ed-ph↗

arXiv2024

Variational learning algorithms for quantum query complexity

Quantum query complexity plays an important role in studying quantum algorithms, which captures the most known quantum algorithms, such as search and period finding. A query algorithm applies $U_tO_x\cdots U_1O_xU_0$ to some input state, where $O_x$ is the oracle dependent on some input variable $x$, and $U_i$s are unitary operations that are independent of $x$, followed by some measurements for readout. In this work, we develop variational learning algorithms to study quantum query complexity, by formulating $U_i$s as parameterized quantum circuits and introducing a loss function that is directly given by the error probability of the query algorithm. We apply our method to analyze various cases of quantum query complexity, including a new algorithm solving the Hamming modulo problem with $4$ queries for the case of $5$-bit modulo $5$, answering an open question raised in arXiv:2112.14682, and the result is further confirmed by a Semidefinite Programming (SDP) algorithm. Compared with the SDP algorithm, our method can be readily implemented on the near-term Noisy Intermediate-Scale Quantum (NISQ) devices and is more flexible to be adapted to other cases such as the fractional query models.

quant-ph↗

arXiv2023

Tapping into Permutation Symmetry for Improved Detection of k-Symmetric Extensions

Symmetric extensions are essential in quantum mechanics, providing a lens to investigate the correlations of entangled quantum systems and to address challenges like the quantum marginal problem. Though semi-definite programming (SDP) is a recognized method for handling symmetric extensions, it grapples with computational constraints, especially due to the large real parameters in generalized qudit systems. In this study, we introduce an approach that adeptly leverages permutation symmetry. By fine-tuning the SDP problem for detecting $ k $-symmetric extensions, our method markedly diminishes the searching space dimensionality and trims the number of parameters essential for positive definiteness tests. This leads to an algorithmic enhancement, reducing the complexity from $ O(d^{2k}) $ to $ O(k^{d^2}) $ in the qudit $ k $-symmetric extension scenario. Additionally, our approach streamlines the process of verifying the positive definiteness of the results. These advancements pave the way for deeper insights into quantum correlations, highlighting potential avenues for refined research and innovations in quantum information theory.

quant-ph↗

arXiv2023

Pure Quantum Gradient Descent Algorithm and Full Quantum Variational Eigensolver

Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, computing the numerical gradient for a function with $d$ variables necessitates at least $d+1$ function evaluations, resulting in a computational complexity of $O(d)$. As the number of variables increases, the classical gradient estimation methods require substantial resources, ultimately surpassing the capabilities of classical computers. Fortunately, leveraging the principles of superposition and entanglement in quantum mechanics, quantum computers can achieve genuine parallel computing, leading to exponential acceleration over classical algorithms in some cases.In this paper, we propose a novel quantum-based gradient calculation method that requires only a single oracle calculation to obtain the numerical gradient result for a multivariate function. The complexity of this algorithm is just $O(1)$. Building upon this approach, we successfully implemented the quantum gradient descent algorithm and applied it to the Variational Quantum Eigensolver (VQE), creating a pure quantum variational optimization algorithm. Compared with classical gradient-based optimization algorithm, this quantum optimization algorithm has remarkable complexity advantages, providing an efficient solution to optimization problems.The proposed quantum-based method shows promise in enhancing the performance of optimization algorithms, highlighting the potential of quantum computing in this field.

quant-ph↗

arXiv2022

Maximum entropy methods for quantum state compatibility problems

Inferring a quantum system from incomplete information is a common problem in many aspects of quantum information science and applications, where the principle of maximum entropy (MaxEnt) plays an important role. The quantum state compatibility problem asks whether there exists a density matrix $ρ$ compatible with some given measurement results. Such a compatibility problem can be naturally formulated as a semidefinite programming (SDP), which searches directly for the existence of a $ρ$. However, for large system dimensions, it is hard to represent $ρ$ directly, since it needs too many parameters. In this work, we apply MaxEnt to solve various quantum state compatibility problems, including the quantum marginal problem. An immediate advantage of the MaxEnt method is that it only needs to represent $ρ$ via a relatively small number of parameters, which is exactly the number of the operators measured. Furthermore, in case of incompatible measurement results, our method will further return a witness that is a supporting hyperplane of the compatible set. Our method has a clear geometric meaning and can be computed effectively with hybrid quantum-classical algorithms.

quant-ph↗

arXiv2022

Quantum imaginary time evolution steered by reinforcement learning

The quantum imaginary time evolution is a powerful algorithm for preparing the ground and thermal states on near-term quantum devices. However, algorithmic errors induced by Trotterization and local approximation severely hinder its performance. Here we propose a deep reinforcement learning-based method to steer the evolution and mitigate these errors. In our scheme, the well-trained agent can find the subtle evolution path where most algorithmic errors cancel out, enhancing the fidelity significantly. We verified the method's validity with the transverse-field Ising model and the Sherrington-Kirkpatrick model. Numerical calculations and experiments on a nuclear magnetic resonance quantum computer illustrate the efficacy. The philosophy of our method, eliminating errors with errors, sheds light on error reduction on near-term quantum devices.

quant-ph↗

arXiv2022

Supervised learning in Hamiltonian reconstruction from local measurements on eigenstates

Reconstructing a system Hamiltonian through measurements on its eigenstates is an important inverse problem in quantum physics. Recently, it was shown that generic many-body local Hamiltonians can be recovered by local measurements without knowing the values of the correlation functions. In this work, we discuss this problem in more depth for different systems and apply the supervised learning method via neural networks to solve it. For low-lying eigenstates, the inverse problem is well-posed, neural networks turn out to be efficient and scalable even with a shallow network and a small data set. For middle-lying eigenstates, the problem is ill-posed, we present a modified method based on transfer learning accordingly. Neural networks can also efficiently generate appropriate initial points for numerical optimization based on the BFGS method.

quant-ph↗

arXiv2022

SpinQ Triangulum: a commercial three-qubit desktop quantum computer

SpinQ Triangulum is the second generation of the desktop quantum computers designed and manufactured by SpinQ Technology. SpinQ's desktop quantum computer series, based on room temperature NMR spectrometer, provide light-weighted, cost-effective and maintenance-free quantum computing platforms that aim to provide real-device experience for quantum computing education for K-12 and college level. These platforms also feature quantum control design capabilities for studying quantum control and quantum noise. Compared with the first generation product, the two-qubit SpinQ Gemini, Triangulum features a three-qubit QPU, smaller dimensions (61 * 33 * 56 cm^3) and lighter (40 kg). Furthermore, the magnetic field is more stable and the performance of quantum control is more accurate. This paper introduces the system design of Triangulum and its new features. As an example of performing quantum computing tasks, we present the implementation of the Harrow-Hassidim-Lloyd (HHL) algorithm on Triangulum, demonstrating Triangulum's capability of undertaking complex quantum computing tasks. SpinQ will continue to develop desktop quantum computing platform with more qubits. Meanwhile, a simplified version of SpinQ Gemini, namely Gemini Mini (https://www.spinq.cn/products#geminiMini-anchor) , has been recently realised. Gemini Mini is much more portable (20* 35 * 26 cm^3, 14 kg) and affordable for most K-12 schools around the world.

quant-ph↗

arXiv2021

Linear Dependence of Post-irradiation Input Bias Currents on Pre-irradiation Values in Silicon Bipolar Microcircuits

We find in experiments a linear dependence of ionization irradiation-induced degradations on pre-irradiation values of the input bias current in bipolar devices with simple input stages. The dependence is found to generally exist in all studied cases of different device types and different irradiation conditions. A unique behavior of the energy distribution of the interface states ($D_{it}$) under irradiation is suggested as the origin of the observed phenomenon: the generation of interface traps through the depassivation of Si-H bonds located near the pre-irradiation interface traps displays a $D_{it}$ as an enlarge of the initial $D_{it}$ and results in the general linear dependence. A more accurate damage prediction method by using the pre-irradiation values is proposed based on the observed phenomenon.

physics.space-ph↗

arXiv2021

SpinQ Gemini: a desktop quantum computer for education and research

SpinQ Gemini is a commercial desktop quantum computer designed and manufactured by SpinQ Technology. It is an integrated hardware-software system. The first generation product with two qubits was launched in January 2020. The hardware is based on NMR spectrometer, with permanent magnets providing $\sim 1$ T magnetic field. SpinQ Gemini operates under room temperature ($0$-$30^{\circ}$C), highlighting its lightweight (55 kg with a volume of $70\times 40 \times 80$ cm$^3$), cost-effective (under $50$k USD), and maintenance-free. SpinQ Gemini aims to provide real-device experience for quantum computing education for K-12 and at the college level. It also features quantum control design capabilities that benefit the researchers studying quantum control and quantum noise. Since its first launch, SpinQ Gemini has been shipped to institutions in Canada, Taiwan and Mainland China. This paper introduces the system of design of SpinQ Gemini, from hardware to software. We also demonstrate examples for performing quantum computing tasks on SpinQ Gemini, including one task for a variational quantum eigensolver of a two-qubit Heisenberg model. The next generations of SpinQ quantum computing devices will adopt models of more qubits, advanced control functions for researchers with comparable cost, as well as simplified models for much lower cost (under $5$k USD) for K-12 education. We believe that low-cost portable quantum computer products will facilitate hands-on experience for teaching quantum computing at all levels, well-prepare younger generations of students and researchers for the future of quantum technologies.

quant-ph↗

arXiv2021

Neural Networks for Quantum Inverse Problems

Quantum Inverse Problem (QIP) is the problem of estimating an unknown quantum system $ρ$ from a set of measurements, whereas the classical counterpart is the Inverse Problem of estimating a distribution from a set of observations. In this paper, we present a neural network based method for QIPs, which has been widely explored for its classical counterpart. The proposed method utilizes the quantum-ness of the QIPs and takes advantage of the computational power of neural networks to achieve higher efficiency for the quantum state estimation. We test the method on the problem of Maximum Entropy Estimation of an unknown state $ρ$ from partial information. Our method yields high fidelity, efficiency and robustness for both numerical experiments and quantum optical experiments.

quant-ph↗

arXiv2020

Simulating Noisy Quantum Circuits with Matrix Product Density Operators

Simulating quantum circuits with classical computers requires resources growing exponentially in terms of system size. Real quantum computer with noise, however, may be simulated polynomially with various methods considering different noise models. In this work, we simulate random quantum circuits in 1D with Matrix Product Density Operators (MPDO), for different noise models such as dephasing, depolarizing, and amplitude damping. We show that the method based on Matrix Product States (MPS) fails to approximate the noisy output quantum states for any of the noise models considered, while the MPDO method approximates them well. Compared with the method of Matrix Product Operators (MPO), the MPDO method reflects a clear physical picture of noise (with inner indices taking care of the noise simulation) and quantum entanglement (with bond indices taking care of two-qubit gate simulation). Consequently, in case of weak system noise, the resource cost of MPDO will be significantly less than that of the MPO due to a relatively small inner dimension needed for the simulation. In case of strong system noise, a relatively small bond dimension may be sufficient to simulate the noisy circuits, indicating a regime that the noise is large enough for an `easy' classical simulation. Moreover, we propose a more effective tensor updates scheme with optimal truncations for both the inner and the bond dimensions, performed after each layer of the circuit, which enjoys a canonical form of the MPDO for improving simulation accuracy. With truncated inner dimension to a maximum value $κ$ and bond dimension to a maximum value $χ$, the cost of our simulation scales as $\sim NDκ^3χ^3$, for an $N$-qubit circuit with depth $D$.

quant-ph↗

arXiv2020

Determining system Hamiltonian from eigenstate measurements without correlation functions

Local Hamiltonians arise naturally in physical systems. Despite its seemingly `simple' local structure, exotic features such as nonlocal correlations and topological orders exhibit in eigenstates of these systems. Previous studies for recovering local Hamiltonians from measurements on an eigenstate $|ψ\rangle$ require information of nonlocal correlation functions. In this work, we develop an algorithm to determine local Hamiltonians from only local measurements on $|ψ\rangle$, by reformulating the task as an unconstrained optimization problem of certain target function of Hamiltonian parameters, with only polynomial number of parameters in terms of system size. We also develop a machine learning-based-method to solve the first-order gradient used in the algorithm. Our method is tested numerically for randomly generated local Hamiltonians and returns promising reconstruction in the desired accuracy. Our result shed light on the fundamental question on how a single eigenstate can encode the full system Hamiltonian, indicating a somewhat surprising answer that only local measurements are enough without additional assumptions, for generic cases.

quant-ph↗

arXiv2020

Upper bounds for relative entropy of entanglement based on active learning

Quantifying entanglement for multipartite quantum state is a crucial task in many aspects of quantum information theory. Among all the entanglement measures, relative entropy of entanglement $E_{R}$ is an outstanding quantity due to its clear geometric meaning, easy compatibility with different system sizes, and various applications in many other related quantity calculations. Lower bounds of $E_R$ were previously found based on distance to the set of positive partial transpose states. We propose a method to calculate upper bounds of $E_R$ based on active learning, a subfield in machine learning, to generate an approximation of the set of separable states. We apply our method to calculate $E_R$ for composite systems of various sizes, and compare with the previous known lower bounds, obtaining promising results. Our method adds a reliable tool for entanglement measure calculation and deepens our understanding for the structure of separable states.

quant-ph↗

arXiv2017

Preparation of Logically Labeled Pure States with Only Two Turns for Bulk Quantum Computation

Quantum state preparation plays an equally important role with quantum operations and measurements in quantum information processing. The previous methods of preparing initial state for bulk quantum computation all have inevitable disadvantages, such as, requiring multiple experiments, causing loss of signals, or requiring molecules with restrictive structure. In this work, three kinds of quantum circuits are introduced to prepare the pseudo-pure states of ($n-1$) qubits in the Hilbert space of $n$ coupled spins which merely need the assist of one ancilla spin and two experiments independent of $n$. Being without gradient fields effectively avoids the reduction of the signals. Our methods have no special requirements on the structure of the used molecules. To test these methods more comprehensively, we experimentally demonstrate the preparation of the labeled pseudo-pure states using heteronuclear 2-qubit and homonuclear 4-qubit nuclear magnetic resonance quantum information processor.

quant-ph↗