quant-phApr 7, 2026

Soft-Quantum Algorithms

Authors: Basil Kyriacou, Mo Kordzanganeh, Maniraman Periyasamy, Alexey Melnikov

Organizations: Terra Quantum AG, 9000 St. Gallen, Switzerland

Read PDF
Ask AI
Cite

Copy citation

DOINot available for this paper

Abstract

Quantum operations on pure states can be fully represented by unitary matrices. Variational quantum circuits, also known as quantum neural networks, embed data and trainable parameters into gate-based operations and optimize the parameters via gradient descent. The high cost of training and low fidelity of current quantum devices, however, restricts much of quantum machine learning to classical simulation. For few-qubit problems with large datasets, training the matrix elements directly, as is done with weight matrices in classical neural networks, can be faster than decomposing data and parameters into gates. We propose a method that trains matrices directly while maintaining unitarity through a single regularization term added to the loss function. A second training step, circuit alignment, then recovers a gate-based architecture from the resulting soft-unitary. On a five-qubit supervised classification task with 1000 datapoints, this two-step process produces a trained variational circuit in under four minutes, compared to over two hours for direct circuit training, while achieving lower binary cross-entropy loss. In a second experiment, soft-unitaries are embedded in a hybrid quantum-classical network for a reinforcement learning cartpole task, where the hybrid agent outperforms a purely classical baseline of comparable size.

Figures & tables

Figure 1: Classification of a top-hat function comparing a directly trained VQC, the soft-unitary solution, and the circuit-aligned VQC. Outputs are rescaled from [−1,1][-1,1] to [0,1][0,1] via a global shift and division by two. Both models use 5 qubits, 1000 datapoints, 200 epochs, 3 reuploading layers, and 4 variational layers. Circuit depth is 10 basic entangling layers per variational layer for the VQC and 69 basic entangling layers for the circuit-aligned soft-unitary.
Figure 2: Training loss versus wall-clock time for the soft-unitary and the directly trained VQC. The soft-unitary loss decreases faster and reaches lower values because it is unconstrained by ansatz and independent of gate count.
Figure 3: Circuit alignment loss, measured as the matrix norm ∥Utarget−Ucircuit∥\|U_{\text{target}}-U_{\text{circuit}}\| , versus epoch. Lower values indicate better agreement between the target soft-unitary and the compiled circuit.
Figure 4: Difference in output values between the soft-unitary and the circuit-aligned model. The mean squared error between the two outputs is 9.6×10−69.6\times 10^{-6} .
Figure 5: The cartpole problem. At each timestep the agent observes the cart’s position, cart’s velocity, pole angle, and pole angular velocity, and must decide whether to push the cart left or right to keep the pole upright for as long as possible.
Figure 6: Comparison of the cartpole task between a purely classical and a hybrid quantum-classical neural network. Both architectures have roughly the same number of classical weights. Duration measures how long the agent keeps the pole upright (higher is better); the dotted line shows the raw duration and the solid line shows the running average. Over 340 episodes, the classical network reached a mean duration of 232.9232.9 while the hybrid model reached 417.0417.0 . The last 71 episodes of the hybrid model were all maxed out at 500.

Explore similar work

CardsList
Feb 16, 2026

Beyond Reinforcement Learning: Fast and Scalable Quantum Circuit Synthesis

Quantum unitary synthesis addresses the problem of translating abstract quantum algorithms into sequences of hardware-executable quantum gates. Solving this task exactly is infeasible in general due to the exponential growth of the underlying combinatorial search space. Existing approaches suffer from misaligned optimization objectives, substantial training costs and limited generalization across different qubit counts. We mitigate these limitations by using supervised learning to approximate the minimum description length of residual unitaries and combining this estimate with stochastic beam search to identify near optimal gate sequences. Our method relies on a lightweight model with zero-shot generalization, substantially reducing training overhead compared to prior baselines. Across multiple benchmarks, we achieve faster wall-clock synthesis times while exceeding state-of-the-art methods in terms of success rate for complex circuits.

Lukas Theißinger, Thore Gerlach, David Berghaus +1

University of Bonn · European Space Agency, Advanced Concepts Team · Fraunhofer IAIS

Quantum Circuit Compilation
AskPDF
May 31, 2026

Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework

Training Variational Quantum Circuits (VQCs) under Noisy Intermediate-Scale Quantum (NISQ) constraints introduces severe computational limitations: classical statevector simulation memory scales exponentially (O(2n)\mathcal{O}(2^n)), and global cost functions suffer from barren plateaus where gradient variance decays exponentially (O(1/2n)\mathcal{O}(1/2^n)). This paper introduces and evaluates the Quantum Algorithm for Distributed Reduction of Entanglements (QADR), a hybrid quantum-classical machine learning framework that decomposes a global nn-qubit VQC into localized sub-circuits operating approximately within the causal light cones of individual target qubits. QADR reduces classical simulation memory scaling from O(2n)\mathcal{O}(2^n) to O(n⋅22d+1)\mathcal{O}(n \cdot 2^{2d+1}) for a light cone radius dd, while naturally mitigating global barren plateaus. We benchmark QADR against standard global VQCs, Support Vector Machines (SVM), and two customized classical parameter-matched neural networks (CANN and PMNN) on the MNIST dataset and the high-dimensional NASA IMS wind turbine drivetrain diagnostic task. QADR demonstrates excellent scalability, operating successfully at nfeatures=2000n_{\text{features}}=2000 where standard global VQCs crash due to memory exhaustion, while matching or exceeding the performance of optimized classical architectures.

Syed Farhan Ahmad, Gregory T. Byrd

Department of ECE, North Carolina State University, Raleigh, North Carolina, USA

Hybrid Quantum-Classical MLBarren PlateausVariational Quantum CircuitsQuantum Circuit TrainabilityFault Diagnosis
AskPDF
Aug 30, 2026

Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment

Hybrid quantum-classical neural networks have emerged as a promising approach for leveraging quantum computing in machine learning while mitigating current hardware limitations. This paper presents Sim-HVQC, a hybrid Deep Quantum Neural Network that couples an adaptive, parameter-free SimAM weighting module with classical feature extraction to preserve class-discriminative information prior to encoding into a Variational Quantum Circuit (VQC). Previous studies are restricted to binary classification [1] [2] [3] [4] [5]. In contrast, the proposed framework is trained and evaluated on various multi-class datasets(MNIST, KMNIST, Fashion-MNIST, and EMNIST). The framework further demonstrates reproducibility, parameter efficiency, and interpretability through multi-seed evaluation, parameter analysis, and latent/quantum feature inspection. The source code is publicly available at https://github.com/Dilli822/ SimAM-HVQC

Dilli Hang Rai

Institute of Science and Technology Tribhuvan University, Kritipur, Nepal

Hybrid Quantum-Classical MLQuantum Neural NetworksImage ClassificationVariational Quantum Circuits
AskPDF