SearcharxivSearch

arXiv subjects

Su-Juan Qin

Publications and source records attributed to Su-Juan Qin.

At least 19 recordsLinked to original sources

Test Case Prioritization for DNNs via Neural Collapse Instability

With the widespread deployment of deep neural networks (DNNs) in safety-critical domains, reducing the cost of model validation under limited testing budgets has become increasingly important. Existing test case prioritization techniques often rely on single-checkpoint confidence signals derived from output probabilities. However, DNNs can be confidently wrong, and the confidence margin between the predicted and competing classes is frequently small, which weakens early fault discovery. To address this limitation, we propose a Neural-Collapse-Inspired Prioritization (NCIP) framework that replaces absolute confidence with cross-checkpoint prediction variability in the terminal training regime, where model geometry becomes highly structured. NCIP introduces two key components. First, it selects an NC-guided representative subset of training checkpoints using an equiangularity score of classifier weights, quantified as the standard deviation of pairwise cosine similarities among class weight vectors. Second, it prioritizes test inputs by their prediction variability across the selected checkpoints, surfacing boundary-adjacent and failure-prone samples that are unstable under checkpoint-induced decision boundary shifts. Extensive experiments across multiple datasets and architectures show that NCIP achieves strong performance in early fault discovery compared with competitive baselines, with 1.5 to 16.6 percent RAUC-ALL gains and 4.9 to 20.6 percent RAUC-500 gains under the same testing budget. NCIP further attains the best average performance across all dataset-model pairs.

cs.LG

Offline dedicated quantum attacks on block cipher constructions based on two parallel permutation-based pseudorandom functions

Quantum cryptanalysis is essential for evaluating the security of cryptographic systems against the threat of quantum computing. Recently, Shi {\it et al.} introduced a dedicated quantum attack on block cipher constructions based on XOR-type functions, which greatly reduces the required resources (including circuit depth, width, and the number of gates) compared to the parallel Grover-meets-Simon algorithm. Here, our contribution is in two aspects. On the one hand, we discover new cryptographic structures amenable to this attack: PolyMAC and constructions based on two parallel permutation-based pseudorandom functions (TPP-PRFs), including XopEM, SoEM22, SUMPIP, and DS-SoEM, thereby answering Shi {\it et al.}' s open question. On the other hand, for constructions based on TPP-PRFs, we break the obstacle that this attack relies on online query by constructing decoupled XOR-type functions, then propose an offline quantum attack on them. Compared to previous results, our offline attack exhibits significantly reduced query complexity. Specifically, the number of queries to the encryption oracle is reduced from $O(2^{(n+t)/2}\cdot (n-t))$ to $O(2^{t}\cdot (n-t))$ in the quantum query model, where $0<t<n$, $t$ is a truncation parameter, and $n$ is the input length of constructions. Further, we enable its implementation in the classical query model, optimizing both the classical query complexity and time complexity from $\tilde O(2^{2n/3})$ to $\tilde O(2^{(2n-t)/3})$ for $0<t \leq n/2$.

quant-ph

Iterative Partition Search Variational Quantum Algorithm for Solving Shortest Vector Problem

The Partition Search Algorithm (PSA) and Iterative Quantum Optimization with an Adaptive Problem (IQOAP) are leading variational quantum algorithms for solving Shortest Vector Problem (SVP). However, each has limitations that restrict its practical impact. IQOAP suffers from ineffective iterations that fail to update the lattice basis, whereas PSA's static partitioning leads to oversized search spaces. In this work, we propose the Iterative Partition Search Algorithm (IPSA), which systematically addresses these drawbacks by integrating a "1-tailed search spaces" with a dynamic, stack-managed iterative process. Specifically, the "1-tailed" strategy ensures that every successful execution yields an effective lattice basis update, thereby eliminating the ineffective iterations associated with IQOAP. Concurrently, the dynamic iterative process reduces the required qubit count, thereby avoiding the limitation of an oversized search space inherent to PSA. We validate IPSA on the Baihua superconducting quantum processor via the Quafu platform. Small-scale real hardware experiments demonstrate that, compared to PSA, IPSA achieves a 14-fold increase in success rate at a cost of less than double the total circuit depth. Conversely, compared to IQOAP, IPSA reduces the total circuit depth by 82.7% while achieving approximately 2.5 times its success rate. Furthermore, we also conduct numerical simulations whose results are in good agreement with the experimental findings and extend our analysis.

quant-ph

An Adaptive Mixer Allocation Algorithm for the Quantum Alternating Operator Ansatz

Recently, Hadfield et al. proposed the quantum alternating operator ansatz algorithm (QAOA+), an extension of the quantum approximate optimization algorithm (QAOA), to solve constrained combinatorial optimization problems (CCOPs). Compared with QAOA, QAOA+ enables the search for optimal solutions within a feasible solution space by encoding problem constraints into the mixer Hamiltonian, thereby reducing the search space and eliminating the possibility of yielding infeasible solutions. However, QAOA+ may incur high overall gate costs when the mixer is applied to all qubits in each layer, and each mixer is costly to implement. To address this challenge, an adaptive mixer allocation strategy is tailored for QAOA+. The resulting algorithm, which integrates this strategy into the original QAOA+ framework, is referred to as AMA-QAOA+. Unlike QAOA+, AMA-QAOA+ adaptively applies the mixer to a subset of qubits in each layer of the mixer unitary operator based on an evaluation function. The performance of AMA-QAOA+ is evaluated on the maximum independent set problem. Numerical simulation results show that, under the same number of optimization runs, AMA-QAOA+ achieves better solution quality than QAOA+, with the optimal approximation ratio improved by $5.30\%$ on ER random graphs and $5.41\%$ on 3-regular graphs. Moreover, AMA-QAOA+ significantly reduces the CNOT gate consumption, requiring only $15.30\%$ and $25.18\%$ of the CNOT gates used by QAOA+ on ER and 3-regular random graphs, respectively. These results demonstrate that AMA-QAOA+ enhances solution quality and computational efficiency, enabling the design of more compact and resource-efficient quantum circuits.

quant-ph

Quantum-Assisted Recursive Algorithm for Solving the Exact Cover Problem

The exact cover problem is an NP-complete problem with broad applications. Studies show that although applying the Quantum Approximate Optimization Algorithm (QAOA) to this problem can yield improved solution quality with deeper circuit depth, it can limit the algorithm's applicability on noisy intermediate-scale quantum devices. To improve solution quality at shallow depth, we propose a Quantum-Assisted Recursive Algorithm (QARA) for solving the exact cover problem. QARA addresses the problem by alternately applying classical and quantum pruning. Classical pruning is a repeatable pre-processing step to simplify the problem. When the classical pruning cannot promote the problem simplification, quantum pruning is invoked. During quantum pruning, QARA extracts information from the QAOA's output state to identify the subset with the strongest selection bias. This subset is then used to prune the problem based on our problem-tailored reduction rules. Furthermore, QARA incorporates a local verification and rollback mechanism to assistively judge the effectiveness of the quantum simplification. After quantum pruning, classical pruning is applied again to the reduced problem if the remaining subsets and element set are not null. This alternating process repeats until the original problem is fully resolved. In our numerical simulations, we evaluate the performance of QARA at one-layer depth on 140 instances with subset sizes ranging from 8 to 20. Numerical results show that the probability of QARA in finding an exact solution is approximately 60\% higher than that of both QAOA and Recursive QAOA, highlighting its efficiency.

quant-ph

QGAN-based data augmentation for hybrid quantum-classical neural networks

Quantum neural networks converge faster and achieve higher accuracy than classical models. However, data augmentation in quantum machine learning remains underexplored. To tackle data scarcity, we integrate quantum generative adversarial networks (QGANs) with hybrid quantum-classical neural networks (HQCNNs) to develop an augmentation framework. We propose two strategies: a general approach to enhance data processing and classification across HQCNNs, and a customized strategy that dynamically generates samples tailored to the HQCNN's performance on specific data categories, improving its ability to learn from complex datasets. Simulation experiments on the MNIST dataset demonstrate that QGAN outperforms traditional data augmentation methods and classical GANs. Compared to baseline DCGAN, QGAN achieves comparable performance with half the parameters, balancing efficiency and effectiveness. This suggests that QGANs can simplify models and generate high-quality data, enhancing HQCNN accuracy and performance. These findings pave the way for applying quantum data augmentation techniques in machine learning.

cs.LG

Progressive Quantum Algorithm for Maximum Independent Set with Quantum Alternating Operator Ansatz

Hadfield et al. proposed a novel Quantum Alternating Operator Ansatz algorithm (QAOA+), and this algorithm has wide applications in solving constrained combinatorial optimization problems (CCOPs) because of the advantages of QAOA+ ansatz in constructing a feasible solution space. In this paper, we propose a Progressive Quantum Algorithm (PQA) with QAOA+ ansatz to solve the Maximum Independent Set (MIS) problem using fewer qubits. The core idea of PQA is to construct a subgraph that is likely to contain the MIS solution of the target graph and then solve the MIS problem on this subgraph to obtain an approximate solution. To construct such a subgraph, PQA starts with a small-scale initial subgraph and progressively expands its graph size utilizing heuristic expansion strategies. After each expansion, PQA solves the MIS problem on the newly generated subgraph. In each run, PQA repeats the expansion and solving process until a predefined stopping condition is reached. Simulation results demonstrate that to achieve an approximation ratio of 0.95, PQA requires only $5.565\%$ ($2.170\%$) of the qubits and $17.59\%$ ($6.430\%$) of the runtime compared with directly solving the original problem using QAOA+ on Erdős-Rényi (3-regular) graphs, highlighting the efficiency of PQA.

quant-ph

A Hierarchical Fused Quantum Fuzzy Neural Network for Image Classification

Neural network is a powerful learning paradigm for data feature learning in the era of big data. However, most neural network models are deterministic models that ignore the uncertainty of data. Fuzzy neural networks are proposed to address this problem. FDNN is a hierarchical deep neural network that derives information from both fuzzy and neural representations, the representations are then fused to form representation to be classified. FDNN perform well on uncertain data classification tasks. In this paper, we proposed a novel hierarchical fused quantum fuzzy neural network (HQFNN). Different from classical FDNN, HQFNN uses quantum neural networks to learn fuzzy membership functions in fuzzy neural network. We conducted simulated experiment on two types of datasets (Dirty-MNIST and 15-Scene), the results show that the proposed model can outperform several existing methods. In addition, we demonstrate the robustness of the proposed quantum circuit.

quant-ph

Multilevel leapfrogging initialization for quantum approximate optimization algorithm

Recently, Zhou et al. have proposed a novel Interpolation-based (INTERP) strategy to generate the initial parameters for the Parameterized Quantum Circuit (PQC) in Quantum Approximate Optimization Algorithm (QAOA). INTERP produces the guess of the initial parameters at level $i+1$ by applying linear interpolation to the optimized parameters at level $i$, achieving better performance than random initialization (RI). Nevertheless, INTERP consumes extensive running costs for deep QAOA because it necessitates optimization at each level of the PQC. To address this problem, a Multilevel Leapfrogging Interpolation (MLI) strategy is proposed. MLI can produce the guess of the initial parameters from level $i+1$ to $i+l$ ($l>1$) at level $i$, omitting the optimization rounds from level $i+1$ to $(i+l-1)$. The final result is that MLI executes optimization at few levels rather than each level, and this operation is referred to as Multilevel Leapfrogging optimization (M-Leap). The performance of MLI is investigated on the Maxcut problem. Compared with INTERP, MLI reduces most optimization rounds. Remarkably, the simulation results demonstrate that MLI can achieve the same quasi-optima as INTERP while consuming only 1/2 of the running costs required by INTERP. In addition, for MLI, where there is no RI except for level $1$, the greedy-MLI strategy is presented. The simulation results suggest that greedy-MLI has better stability (i.e., a higher average approximation ratio) than INTERP and MLI beyond obtaining the same quasi-optima as INTERP. According to the efficiency of finding the quasi-optima, the idea of M-Leap might be extended to other training tasks, especially those requiring numerous optimizations, such as training adaptive quantum circuits.

quant-ph

Variational quantum algorithm-preserving feasible space for solving the uncapacitated facility location problem

The Quantum Alternating Operator Ansatz (QAOA+) is one of the Variational Quantum Algorithm (VQA) specifically developed to tackle combinatorial optimization problems by exploring the feasible space in search of a target solution. For constrained optimization problems with unconstrained variables, which we call Unconstrained-Variables Problems (UVPs), the mixed operators in the QAOA+ circuit are applied to the constrained variables, while the single-qubit rotating gates $R_X$ operate on the unconstrained variables. The expressibility of this circuit is limited by the shortage of two-qubit gates and the parameter sharing in the $R_X$, which consequently impacts the performance of QAOA+ for solving UVPs. Therefore, it is crucial to develop a suitable ansatz for UVPs. In this paper, we propose the Variational Quantum Algorithm-Preserving Feasible Space (VQA-PFS) ansatz, exemplified by the Uncapacitated Facility Location Problem (UFLP), that applies mixed operators on constrained variables while employing Hardware-Efficient Ansatz (HEA) on unconstrained variables. The numerical results demonstrate that VQA-PFS significantly enhances the success probability and exhibits faster convergence compared to QAOA+, Quantum Approximation Optimization Algorithm (QAOA), and HEA. Furthermore, VQA-PFS reduces the circuit depth dramatically in comparison to QAOA+ and QAOA. Our algorithm is general and instructive in tackling UVPs.

quant-ph

A general quantum matrix exponential dimensionality reduction framework based on block-encoding

As a general framework, Matrix Exponential Dimensionality Reduction (MEDR) deals with the small-sample-size problem that appears in linear Dimensionality Reduction (DR) algorithms. High complexity is the bottleneck in this type of DR algorithm because one has to solve a large-scale matrix exponential eigenproblem. To address it, here we design a general quantum algorithm framework for MEDR based on the block-encoding technique. This framework is configurable, that is, by selecting suitable methods to design the block-encodings of the data matrices, a series of new efficient quantum algorithms can be derived from this framework. Specifically, by constructing the block-encodings of the data matrix exponentials, we solve the eigenproblem and then obtain the digital-encoded quantum state corresponding to the compressed low-dimensional dataset, which can be directly utilized as input state for other quantum machine learning tasks to overcome the curse of dimensionality. As applications, we apply this framework to four linear DR algorithms and design their quantum algorithms, which all achieve a polynomial speedup in the dimension of the sample over their classical counterparts.

quant-ph

Quantum Alternating Operator Ansatz for Solving the Minimum Exact Cover Problem

The Quantum Alternating Operator Ansatz (QAOA+) is an extension of the Quantum Approximate Optimization Algorithm (QAOA), where the search space is smaller in solving constrained combinatorial optimization problems. However, QAOA+ requires a trivial feasible solution as the initial state, so it cannot be used for problems that are difficult to find a trivial feasible solution. For simplicity, we call them as Non-Trivial-Feasible-Solution Problems (NTFSP). In this paper, we take the Minimum Exact Cover (MEC) problem as an example, studying how to apply QAOA+ to NTFSP. As we know, exact covering (EC) is the feasible space of MEC problem, which has no trivial solutions. To overcome the above problem, the EC problem is divided into two steps to solve. First, disjoint sets are obtained, which is equivalent to solving independent sets. Second, on this basis, the sets covering all elements (i.e., EC) are solved. In other words, we transform MEC into a multi-objective constrained optimization problem, where feasible space consists of independent sets that are easy to find. Finally, we also verify the feasibility of the algorithm from numerical experiments. Our method provides a feasible way for applying QAOA+ to NTFSP, and is expected to expand its application significantly.

quant-ph

Quantum Algorithm for Anomaly Detection of Sequences

Anomaly detection of sequences is a hot topic in data mining. Anomaly Detection using Piecewise Aggregate approximation in the Amplitude Domain (called ADPAAD) is one of the widely used methods in anomaly detection of sequences. The core step in the classical algorithm for performing ADPAAD is to construct an approximate representation of the subsequence, where the elements of each subsequence are divided into several subsections according to the amplitude domain and then the average of the subsections is computed. It is computationally expensive when processing large-scale sequences. In this paper, we propose a quantum algorithm for ADPAAD, which can divide the subsequence elements and compute the average in parallel. Our quantum algorithm can achieve polynomial speedups on the number of subsequences and the length of subsequences over its classical counterpart.

quant-ph

Quantum mean centering for block-encoding-based quantum algorithm

Mean Centering (MC) is an important data preprocessing technique, which has a wide range of applications in data mining, machine learning, and multivariate statistical analysis. When the data set is large, this process will be time-consuming. In this paper, we propose an efficient quantum MC algorithm based on the block-encoding technique, which enables the existing quantum algorithms can get rid of the assumption that the original data set has been classically mean-centered. Specifically, we first adopt the strategy that MC can be achieved by multiplying by the centering matrix $C$, i.e., removing the row means, column means and row-column means of the original data matrix $X$ can be expressed as $XC$, $CX$ and $CXC$, respectively. This allows many classical problems involving MC, such as Principal Component Analysis (PCA), to directly solve the matrix algebra problems related to $XC$, $CX$ or $CXC$. Next, we can employ the block-encoding technique to realize MC. To achieve it, we first show how to construct the block-encoding of the centering matrix $C$, and then further obtain the block-encodings of $XC$, $CX$ and $CXC$. Finally, we describe one by one how to apply our MC algorithm to PCA and other algorithms.

quant-ph

Quantum discriminative canonical correlation analysis

Discriminative Canonical Correlation Analysis (DCCA) is a powerful supervised feature extraction technique for two sets of multivariate data, which has wide applications in pattern recognition. DCCA consists of two parts: (i) mean-centering that subtracts the sample mean from the sample; (ii) solving the generalized eigenvalue problem. The cost of DCCA is expensive when dealing with a large number of high-dimensional samples. To solve this problem, here we propose a quantum DCCA algorithm. Specifically, we devise an efficient method to compute the mean of all samples, then use block-Hamiltonian simulation and quantum phase estimation to solve the generalized eigenvalue problem. Our algorithm achieves a polynomial speedup in the dimension of samples under certain conditions over its classical counterpart.

quant-ph

A quantum algorithm for solving eigenproblem of the Laplacian matrix of a fully connected weighted graph

Solving eigenproblem of the Laplacian matrix of a fully connected weighted graph has wide applications in data science, machine learning, and image processing, etc. However, this is very challenging because it involves expensive matrix operations. Here, we propose an efficient quantum algorithm to solve it based on a assumption that the element of each vertex and its norms can be effectively accessed via a quantum random access memory data structure. Specifically, we adopt the optimal Hamiltonian simulation technique based on the block-encoding framework to implement the quantum simulation of the Laplacian matrix. Then, the eigenvalues and eigenvectors of the Laplacian matrix are extracted by the quantum phase estimation algorithm. The core of our entire algorithm is to construct the block-encoding of the Laplacian matrix. To achieve this, we propose in detail how to construct the block-encodings of operators containing the information of the weight matrix and the degree matrix respectively, and further obtain the block-encoding of the Laplacian matrix. Compared with its classical counterpart, our algorithm has a polynomial speedup on the number of vertices and an exponential speedup on the dimension of each vertex. We also show that our algorithm can be extended to solve the eigenproblem of symmetric (non-symmetric) normalized Laplacian matrix.

quant-ph

Quantum algorithm for Neighborhood Preserving Embedding

Neighborhood Preserving Embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101, 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality $n$. However, the algorithm has two disadvantages: (1) It is incomplete in the sense that the input of the third sub-algorithm cannot be obtained by the second sub-algorithm. (2) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points $m$ and an exponential speedup on the dimensionality $n$ under certain conditions over the classical NPE algorithm, and achieve significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA.

quant-ph

Block-encoding based quantum algorithm for linear systems with displacement structures

Matrices with the displacement structures of circulant, Toeplitz, and Hankel types as well as matrices with structures generalizing these types are omnipresent in computations of sciences and engineering. In this paper, we present efficient and memory-reduced quantum algorithms for solving linear systems with such structures by devising a new approach to implement the block-encodings of these structured matrices. More specifically, by decomposing $n\times n$ dense matrices into linear combinations of displacement matrices, we first deduce the parameterized representations of the matrices with displacement structures so that they can be treated similarly. With such representations, we then construct $ε$-approximate block-encodings of these structured matrices in two different data access models, i.e., the black-box model and the QRAM data structure model. It is shown the quantum linear system solvers based on the proposed block-encodings provide a quadratic speedup with respect to the dimension over classical algorithms in the black-box model and an exponential speedup in the QRAM data structure model. In particular, these linear system solvers subsume known results with significant improvements and also motivate new instances where there was no specialized quantum algorithm before. As an application, one of the quantum linear system solvers is applied to the linear prediction of time series, which justifies the claimed quantum speedup is achievable for problems of practical interest.

quant-ph