Searcharxiv⌕ Search

arXiv subjects

Yue Ban

Publications and source records attributed to Yue Ban.

At least 37 records · Page 2Linked to original sources

Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem

The bin packing problem, a classical NP-hard combinatorial optimization challenge, has emerged as a promising candidate for quantum computing applications. In this work, we address the one-dimensional bin packing problem (1dBPP) using a digitized counter-diabatic quantum algorithm (DC-QAOA), which incorporates counter-diabatic (CD) driving to reduce quantum resource requirements while maintaining high solution quality, outperforming traditional methods such as QAOA. We evaluate three ansatz schemes-DC-QAOA, a CD-inspired ansatz, and a CD-mixer ansatz-each integrating CD terms with distinct combinations of cost and mixer Hamiltonians, resulting in different DC-QAOA variants. Among these, the CD-mixer ansatz demonstrates superior performance, showing robustness across various iteration counts, layer depths, and Hamiltonian steps, while consistently producing the most accurate approximations to exact solutions. To validate our approach, we solve a 10-item 1dBPP instance on an IBM quantum computer, optimizing circuit structures through simulations. Despite constraints on circuit depth, the CD-mixer ansatz achieves high accuracy and a high likelihood of success. These findings establish DC-QAOA, particularly the CD-mixer variant, as a powerful framework for solving combinatorial optimization problems on near-term quantum devices.

quant-ph↗

Tunable lateral displacement and spin beam splitter for ballistic electrons in two-dimensional magnetic-electric nanostructures

We investigate the lateral displacements for ballistic electron beams in a two-dimensional electron gas modulated by metallic ferromagnetic (FM) stripes with parallel and antiparallel (AP) magnetization configurations. It is shown that the displacements are negative as well as positive, which can be controlled by adjusting the electric potential induced by the applied voltage and the magnetic field strength of FM stripes. Based on these phenomena, we propose an efficient way to realize a spin beam splitter, which can completely separate spin-up and spin-down electron beams in the AP configuration by their corresponding spatial positions.

cond-mat.mes-hall↗

Flying Spin Qubits in Quantum Dot Arrays Driven by Spin-Orbit Interaction

Quantum information transfer is fundamental for scalable quantum computing in any potential platform and architecture. Hole spin qubits, owing to their intrinsic spin-orbit interaction (SOI), promise fast quantum operations which are fundamental for the implementation of quantum gates. Yet, the influence of SOI in quantum transfer protocols remains an open question. Here, we investigate flying spin qubits mediated by SOI, using shortcuts to adiabaticity protocols, i.e., the long-range transfer of spin qubits and the quantum distribution of entangled pairs in semiconductor quantum dot arrays. We show that electric field manipulation allows dynamical control of the SOI, enabling simultaneously the implementation of quantum gates during the transfer, with the potential to significantly accelerate quantum algorithms. By harnessing the ability to perform quantum gates in parallel with the transfer, we implement dynamical decoupling schemes to focus and preserve the spin state, leading to higher transfer fidelity.

cond-mat.mes-hall↗

Quantum Active Learning

Quantum machine learning, as an extension of classical machine learning that harnesses quantum mechanics, facilitates effiient learning from data encoded in quantum states. Training a quantum neural network typically demands a substantial labeled training set for supervised learning. Human annotators, often experts, provide labels for samples through additional experiments, adding to the training cost. To mitigate this expense, there is a quest for methods that maintain model performance over fully labeled datasets while requiring fewer labeled samples in practice, thereby extending few-shot learning to the quantum realm. Quantum active learning estimates the uncertainty of quantum data to select the most informative samples from a pool for labeling. Consequently, a QML model is supposed to accumulate maximal knowledge as the training set comprises labeled samples selected via sampling strategies. Notably, the QML models trained within the QAL framework are not restricted to specific types, enabling performance enhancement from the model architecture's perspective towards few-shot learning. Recognizing symmetry as a fundamental concept in physics ubiquitous across various domains, we leverage the symmetry inherent in quantum states induced by the embedding of classical data for model design. We employ an equivariant QNN capable of generalizing from fewer data with geometric priors. We benchmark the performance of QAL on two classification problems, observing both positive and negative results. QAL effectively trains the model, achieving performance comparable to that on fully labeled datasets by labeling less than 7\% of the samples in the pool with unbiased sampling behavior. Furthermore, we elucidate the negative result of QAL being overtaken by random sampling baseline through miscellaneous numerical experiments. (character count limit, see the main text)

quant-ph↗

Exploring Ground States of Fermi-Hubbard Model on Honeycomb Lattices with Counterdiabaticity

Exploring the ground state properties of many-body quantum systems conventionally involves adiabatic processes, alongside exact diagonalization, in the context of quantum annealing or adiabatic quantum computation. Shortcuts to adiabaticity by counter-diabatic driving serve to accelerate these processes by suppressing energy excitations. Motivated by this, we develop variational quantum algorithms incorporating the auxiliary counterdiabatic interactions, comparing them with digitized adiabatic algorithms. These algorithms are then implemented on gate-based quantum circuits to explore the ground states of the Fermi-Hubbard model on honeycomb lattices, utilizing systems with up to 26 qubits. The comparison reveals that the counter-diabatic inspired ansatz is superior to traditional Hamiltonian variational ansatz. Furthermore, the number and duration of Trotter steps are analyzed to understand and mitigate errors. Given the model's relevance to materials in condensed matter, our study paves the way for using variational quantum algorithms with counterdiabaticity to explore quantum materials in the noisy intermediate-scale quantum era.

quant-ph↗

Optimizing edge state transfer in a Su-Schrieffer-Heeger chain via hybrid analog-digital strategies

The Su-Schrieffer-Heeger (SSH) chain, which serves as a paradigmatic model for comprehending topological phases and their associated edge states, plays an essential role in advancing our understanding of quantum materials and quantum information processing and technology. In this paper, we introduce a hybrid analog-digital protocol designed for the nonadiabatic yet high-fidelity transfer of edge states in an SSH chain, featuring two sublattices, A and B. The core of our approach lies in harnessing the approximate time-dependent counterdiabatic (CD) interaction, derived from adiabatic gauge potentials. However, to enhance transfer fidelity, particularly in long-distance chains, higher-order nested commutators become crucial. To simplify the experimental implementation and navigate computational complexities, we identify the next-to-nearest-neighbor hopping terms between sublattice A sites as dominant CD driving and further optimize them by using variational quantum circuits. Through digital quantum simulation, our protocol showcases the capability to achieve rapid and robust solutions, even in the presence of disorder. This analog-digital transfer protocol, an extension of quantum control methodology, establishes a robust framework for edge-state transfer. Importantly, the optimal CD driving identified can be seamlessly implemented across various quantum registers, highlighting the versatility of our approach.

quant-ph↗

Regressions on quantum neural networks at maximal expressivity

We analyze the expressivity of a universal deep neural network that can be organized as a series of nested qubit rotations, accomplished by adjustable data re-uploads. While the maximal expressive power increases with the depth of the network and the number of qubits, it is fundamentally bounded by the data encoding mechanism. Focusing on regression problems, we systematically investigate the expressivity limits for different measurements and architectures. The presence of entanglement, either by entangling layers or global measurements, saturate towards this bound. In these cases, entanglement leads to an enhancement of the approximation capabilities of the network compared to local readouts of the individual qubits in non-entangling networks. We attribute this enhancement to a larger survival set of Fourier harmonics when decomposing the output signal.

quant-ph↗

Scattering of relativistic electrons and analogies with optical phenomena: A study of longitudinal and transverse shifts at step potentials

We investigate the behavior of relativistic electrons encountering a potential step through analogies with optical phenomena. By accounting for the conservation of Dirac current, we elucidate that the Goos-Hänchen shift can be understood as a combination of two components: one arising from the current entering the transmission region and the other originating from the interference between the incident and reflected beams. This result has been proven to be consistent with findings obtained utilizing the stationary phase method. Moreover, we explore the transverse Imbert-Fedorov shift, by applying both current conservation and total angular momentum conservation, revealing intriguing parallel to the spin Hall effect. Beyond enriching our comprehension of fundamental quantum phenomena, our findings have potential applications for designing and characterizing devices using Dirac and topological materials.

quant-ph↗

Photonic counterdiabatic quantum optimization algorithm

We propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization problems. Inspired by counterdiabatic protocols, our algorithm significantly reduces the required quantum operations for optimization as compared to adiabatic protocols. This reduction enables us to tackle non-convex continuous optimization and countably infinite integer programming within the near-term era of quantum computing. Through comprehensive benchmarking, we demonstrate that our approach outperforms existing state-of-the-art hybrid adiabatic quantum algorithms in terms of convergence and implementability. Remarkably, our algorithm offers a practical and accessible experimental realization, bypassing the need for high-order operations and overcoming experimental constraints. We conduct proof-of-principle experiments on an eight-mode nanophotonic quantum chip, successfully showcasing the feasibility and potential impact of the algorithm.

quant-ph↗

Quantum neural networks with multi-qubit potentials

We propose quantum neural networks that include multi-qubit interactions in the neural potential leading to a reduction of the network depth without losing approximative power. We show that the presence of multi-qubit potentials in the quantum perceptrons enables more efficient information processing tasks such as XOR gate implementation and prime numbers search, while it also provides a depth reduction to construct distinct entangling quantum gates like CNOT, Toffoli, and Fredkin. This simplification in the network architecture paves the way to address the connectivity challenge to scale up a quantum neural network while facilitates its training.

quant-ph↗

Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers

Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have been proposed, with the three-dimensional Bin Packing Problem as the closest one to real-world use cases. We introduce a hybrid quantum-classical framework for solving real-world three-dimensional Bin Packing Problems (Q4RealBPP), considering different realistic characteristics, such as: i) package and bin dimensions, ii) overweight restrictions, iii) affinities among item categories and iv) preferences for item ordering. Q4RealBPP permits the solving of real-world oriented instances of 3dBPP, contemplating restrictions well appreciated by industrial and logistics sectors.

cs.ET↗

A Neural Network Assisted $^{171}$Yb$^{+}$ Quantum Magnetometer

A versatile magnetometer must deliver a readable response when exposed to target fields in a wide range of parameters. In this work, we experimentally demonstrate that the combination of $^{171}$Yb$^{+}$ atomic sensors with adequately trained neural networks enables to investigate target fields in distinct challenging scenarios. In particular, we characterize radio frequency (RF) fields in the presence of large shot noise, including the limit case of continuous data acquisition via single-shot measurements. Furthermore, by incorporating neural networks we significantly extend the working regime of atomic magnetometers into scenarios in which the RF driving induces responses beyond their standard harmonic behavior. Our results indicate the benefits to integrate neural networks at the data processing stage of general quantum sensing tasks to decipher the information contained in the sensor responses.

quant-ph↗

Neural networks for Bayesian quantum many-body magnetometry

Entangled quantum many-body systems can be used as sensors that enable the estimation of parameters with a precision larger than that achievable with ensembles of individual quantum detectors. Typically, the parameter estimation strategy requires the microscopic modelling of the quantum many-body system, as well as a an accurate description of its dynamics. This entails a complexity that can hinder the applicability of Bayesian inference techniques. In this work we show how to circumvent these issues by using neural networks that faithfully reproduce the dynamics of quantum many-body sensors, thus allowing for an efficient Bayesian analysis. We exemplify with an XXZ model driven by magnetic fields, and show that our method is capable to yield an estimation of field parameters beyond the standard quantum limit scaling. Our work paves the way for the practical use of quantum many-body systems as black-box sensors exploiting quantum resources to improve precision estimation.

quant-ph↗

Time-Optimal Quantum Driving by Variational Circuit Learning

The simulation of quantum dynamics on a digital quantum computer with parameterized circuits has widespread applications in fundamental and applied physics and chemistry. In this context, using the hybrid quantum-classical algorithm, combining classical optimizers and quantum computers, is a competitive strategy for solving specific problems. We put forward its use for optimal quantum control. We simulate the wave-packet expansion of a trapped quantum particle on a quantum device with a finite number of qubits. We then use circuit learning based on gradient descent to work out the intrinsic connection between the control phase transition and the quantum speed limit imposed by unitary dynamics. We further discuss the robustness of our method against errors and demonstrate the absence of barren plateaus in the circuit. The combination of digital quantum simulation and hybrid circuit learning opens up new prospects for quantum optimal control.

quant-ph↗

Digital Quantum Simulation and Circuit Learning for the Generation of Coherent States

Coherent states, known as displaced vacuum states, play an important role in quantum information processing, quantum machine learning,and quantum optics. In this article, two ways to digitally prepare coherent states in quantum circuits are introduced. First, we construct the displacement operator by decomposing it into Pauli matrices via ladder operators, i.e., creation and annihilation operators. The high fidelity of the digitally generated coherent states is verified compared with the Poissonian distribution in Fock space. Secondly, by using Variational Quantum Algorithms, we choose different ansatzes to generate coherent states. The quantum resources -- such as numbers of quantum gates, layers and iterations -- are analyzed for quantum circuit learning. The simulation results show that quantum circuit learning can provide high fidelity on learning coherent states by choosing appropriate ansatzes.

quant-ph↗

Meta-Learning Digitized-Counterdiabatic Quantum Optimization

Solving optimization tasks using variational quantum algorithms has emerged as a crucial application of the current noisy intermediate-scale quantum devices. However, these algorithms face several difficulties like finding suitable ansatz and appropriate initial parameters, among others. In this work, we tackle the problem of finding suitable initial parameters for variational optimization by employing a meta-learning technique using recurrent neural networks. We investigate this technique with the recently proposed digitized-counterdiabatic quantum approximate optimization algorithm (DC-QAOA) that utilizes counterdiabatic protocols to improve the state-of-the-art QAOA. The combination of meta learning and DC-QAOA enables us to find optimal initial parameters for different models, such as MaxCut problem and the Sherrington-Kirkpatrick model. Decreasing the number of iterations of optimization as well as enhancing the performance, our protocol designs short depth circuit ansatz with optimal initial parameters by incorporating shortcuts-to-adiabaticity principles into machine learning methods for the near-term devices.

quant-ph↗

Machine-learning assisted quantum control in random environment

Disorder in condensed matter and atomic physics is responsible for a great variety of fascinating quantum phenomena, which are still challenging for understanding, not to mention the relevant dynamical control. Here we introduce proof of the concept and analyze neural network-based machine learning algorithm for achieving feasible high-fidelity quantum control of a particle in random environment. To explicitly demonstrate its capabilities, we show that convolutional neural networks are able to solve this problem as they can recognize the disorder and, by supervised learning, further produce the policy for the efficient low-energy cost control of a quantum particle in a time-dependent random potential. We have shown that the accuracy of the proposed algorithm is enhanced by a higher-dimensional mapping of the disorder pattern and using two neural networks, each properly trained for the given task. The designed method, being computationally more efficient than the gradient-descent optimization, can be applicable to identify and control various noisy quantum systems on a heuristic basis.

cond-mat.dis-nn↗

Mutual Reinforcement between Neural Networks and Quantum Physics

Quantum machine learning emerges from the symbiosis of quantum mechanics and machine learning. In particular, the latter gets displayed in quantum sciences as: (i) the use of classical machine learning as a tool applied to quantum physics problems, (ii) or the use of quantum resources such as superposition, entanglement, or quantum optimization protocols to enhance the performance of classification and regression tasks compare to their classical counterparts. This paper reviews examples in these two scenarios. On the one hand, a classical neural network is applied to design a new quantum sensing protocol. On the other hand, the design of a quantum neural network based on the dynamics of a quantum perceptron with the application of shortcuts to adiabaticity gives rise to a short operation time and robust performance. These examples demonstrate the mutual reinforcement of both neural networks and quantum physics.

quant-ph↗