Variational Quantum Algorithms (VQAs) are a central class of hybrid quantum-classical methods for optimization on noisy intermediate-scale quantum (NISQ) hardware. Their scalability is constrained by the cost of gradient evaluation via the parameter-shift rule, whose complexity grows with both the number of circuit parameters and Pauli terms in the Hamiltonian, quickly dominating runtime for deep circuits or large qubit counts. We present TREV (Tensor-Ring Evaluated Variational algorithms), a modular Python library that accelerates VQA simulation through batched parameter evaluation within tensor-ring state representations. By amortizing contraction and sampling costs across multiple parameter shifts, TREV exploits GPU-parallel tensor contractions to achieve substantial runtime reduction with tunable memory-throughput trade-offs. Implemented in PyTorch, the framework supports both deterministic contraction-based and stochastic sampling-based evaluations. Benchmarks on Max-Cut, Traveling Salesperson Problem (TSP), and molecular ground-state energy estimation (H2, H4, LiH, BeH2) show comparable accuracy and up to 97% runtime reduction over sequential evaluation, while outperforming PennyLane, TensorCircuit, and Qiskit in runtime scalability. The chemistry benchmarks further demonstrate that TREV handles arbitrary Pauli Hamiltonians beyond QUBO formulations, broadening its applicability to quantum chemistry.
Variational Quantum Algorithms (VQAs) are a central class of hybrid quantum-classical methods for optimization on noisy intermediate-scale quantum (NISQ) hardware. Their scalability is constrained by the cost of gradient evaluation via the parameter-shift rule, whose complexity grows with both the number of circuit parameters and Pauli terms in the Hamiltonian, quickly dominating runtime for deep circuits or large qubit counts. We present TREV (Tensor-Ring Evaluated Variational algorithms), a modular Python library that accelerates VQA simulation through batched parameter evaluation within tensor-ring state representations. By amortizing contraction and sampling costs across multiple parameter shifts, TREV exploits GPU-parallel tensor contractions to achieve substantial runtime reduction with tunable memory-throughput trade-offs. Implemented in PyTorch, the framework supports both deterministic contraction-based and stochastic sampling-based evaluations. Benchmarks on Max-Cut, Traveling Salesperson Problem (TSP), and molecular ground-state energy estimation (H2, H4, LiH, BeH2) show comparable accuracy and up to 97% runtime reduction over sequential evaluation, while outperforming PennyLane, TensorCircuit, and Qiskit in runtime scalability. The chemistry benchmarks further demonstrate that TREV handles arbitrary Pauli Hamiltonians beyond QUBO formulations, broadening its applicability to quantum chemistry.
Variational Quantum Algorithms (VQAs) are a central class of hybrid quantum–classical methods for optimization on noisy intermediate-scale quantum (NISQ) hardware. Their scalability is constrained by the cost of gradient evaluation via the parameter-shift rule, whose complexity grows with both the number of circuit parameters and Pauli terms in the Hamiltonian, quickly dominating runtime for deep circuits or large qubit counts. We present TREV (Tensor-Ring Evaluated Variational algorithms), a Python library that accelerates VQA simulation through batched parameter evaluation within tensor-ring state representations . By amortizing contraction and sampling costs across multiple parameter shifts, TREV exploits GPU-parallel tensor contractions to achieve substantial runtime reduction with tunable memory–throughput trade-offs. Implemented in PyTorch, the framework supports both deterministic contraction-based and stochastic sampling-based evaluations. Benchmarks on Max-Cut, Traveling Salesperson Problem (TSP), and molecular ground-state energy estimation (H 2 , H 4 , LiH, BeH 2 ) show comparable accuracy and up to 97% runtime reduction over sequential evaluation, while outperforming PennyLane, TensorCircuit, and Qiskit in runtime scalability. The chemistry benchmarks further demonstrate that TREV handles arbitrary Pauli Hamiltonians beyond QUBO formulations, broadening its applicability to quantum chemistry.
Variational quantum algorithms (VQAs) have emerged as a promising candidate for realizing quantum advantage in machine learning and optimization tasks on noisy intermediate-scale quantum (NISQ) devices. Despite significant theoretical promise, the practical impact of VQAs is constrained by the exponential growth in computational resources required for classical simulation, the onset of barren plateaus in parameterized landscapes, and the inherent difficulties of scaling classical optimization routines to circuits with many qubits and layers. Addressing these intertwined challenges is essential for both advancing quantum algorithm development and extracting actionable physical insights from modern quantum hardware.This dissertation develops, analyzes, and validates an efficient framework based on approximate tensor ring decompositions for the classical simulation, training, and benchmarking of variational quantum circuits and eigensolvers. The first component of this work formalizes the representation of quantum states and gates within a cyclic tensor ring structure, enabling the compression of parameterized quantum circuits to linear scaling in both qubit number and circuit depth, while preserving essential quantum correlations and entanglement structure. Gate operations are efficiently approximated via truncated singular value decomposition, and novel algorithms for forward propagation and gradient-based training in the tensor ring domain are developed. These methodological advances are systematically benchmarked on standard supervised learning tasks, including Iris and MNIST datasets, and compared to conventional statevector and matrix product state baselines, resulting in competitive accuracy and orders-of-magnitude reductions in simulation cost. Extending this framework, the dissertation also introduces a scalable method for gradient evaluation in variational quantum eigensolvers (VQE) using the approximate tensor ring representation. This approach enables the simulation and training of large circuits for combinatorial optimization problems, supporting practical qubit counts and circuit depths inaccessible to traditional simulation methods. Detailed experiments on the Maximum-Cut optimization problem demonstrate both the computational efficiency and robustness of the tensor ring framework in nontrivial optimization landscapes.Collectively, the results establish approximate tensor ring decomposition as a versatile and powerful framework for advancing quantum machine learning and discrete optimization, supporting both pre-deployment benchmarking on classical hardware and algorithm design for next-generation quantum devices. This work provides a foundation for the further exploration of scalable quantum-classical hybrid algorithms, with implications for quantum simulation, optimization, and beyond.
Variational quantum algorithms, especially quantum approximate optimization and the variational quantum eigensolver (VQE), have demonstrated their potential to provide computational advantage in the realm of combinatorial optimization. However, these algorithms suffer from classically intractable gradients limiting the scalability. This work addresses the scalability challenge for the VQE by proposing a classical gradient computation method which utilizes the parameter-shift rule but computes the expected values from the circuits using a tensor-ring approximation. The parametrized gates from the circuit transform the tensor ring by contracting the matrix along the free edges of the tensor ring. While the single-qubit gates do not alter the ring structure, the state transformations from the two-qubit rotations are evaluated by truncating the singular values, thereby preserving the structure of the tensor ring and reducing the computational complexity. This variation of the matrix-product-state approximation grows linearly in number of qubits and the number of two-qubit gates as opposed to the exponential growth in the classical simulations, allowing for a faster evaluation of the gradients on classical simulators.
Variational Quantum Algorithms (VQAs) are promising methods for solving combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) devices. However, benchmarking VQAs is difficult due to their stochastic behavior and the lack of standardized performance criteria. This work introduces a general framework for evaluating VQAs applied to Quadratic Unconstrained Binary Optimization (QUBO) problems. The framework uses three complementary metrics: feasibility, quality, and reproducibility. It also introduces a quality diagram that visualizes trade-offs between success probability and computational resources. Reproducibility is formalized using Shannon entropy, and a decision rule is defined for selecting algorithms under resource constraints. As a demonstration, the framework is applied to several VQAs using Conditional Value at Risk (CVaR) cost functions and different shot counts on a 16-qubit QUBO instance. The results show how the framework supports systematic benchmarking and provides a foundation for adaptive algorithm selection in hybrid quantum-classical workflows.
Quantum computing has emerged as a transformative approach for tackling complex problems in quantum chemistry, particularly in simulating multielectron systems and electron-phonon interactions. However, the current noisy intermediate-scale quantum (NISQ) devices face significant challenges in implementing practical quantum algorithms due to error accumulation caused by increased circuit depth, qubit counts, and gate operations. To address these challenges, we present TenCirChem, an open-source Python package specifically designed for implementing variational quantum algorithms in quantum computational chemistry. TenCirChem demonstrates exceptional performance in simulating unitary coupled-cluster circuits through its innovative use of compact representations for quantum states and excitation operators. This package supports noisy circuit simulation and provides advanced algorithms for variational quantum dynamics, enabling researchers to explore complex chemical phenomena. Its capabilities are exemplified in various applications, including the calculation of potential energy curves and the investigation of quantum gate error impacts on molecular systems. Moreover, TenCirChem’s seamless integration with real quantum hardware makes it a versatile tool for both simulation and experimentation. A key innovation developed within the TenCirChem framework is the Clifford-based Hamiltonian engineering approach for molecules (CHEM). This algorithm addresses the critical challenge of achieving chemical accuracy with shallow quantum circuits, a fundamental requirement for practical applications on NISQ devices. CHEM employs a sophisticated Clifford-based Hamiltonian transformation that operates within the variational quantum eigensolver (VQE) framework using hardware-efficient ansatz. The method ensures four crucial advantages: (1) generation of initial circuit parameters corresponding to Hartree-Fock energy, (2) maximization of initial energy gradients with respect to circuit parameters, (3) minimal classical processing overhead without additional quantum resource requirements, and (4) compatibility with any circuit topology. Through quantum hardware emulator demonstrations, CHEM has achieved chemical accuracy for systems up to 12 qubits with fewer than 30 two-qubit gates, representing a significant advancement in practical quantum computational chemistry. To enhance the efficiency of variational quantum algorithms, we developed the sequential optimization with approximate parabola (SOAP) method, specifically designed for parameter optimization in unitary coupled-cluster ansatz. SOAP addresses the critical bottleneck of measurement requirements in VQE by implementing an innovative optimization strategy that approximates the energy landscape as quadratic functions. This approach minimizes the number of energy evaluations while incorporating parameter correlations through the integration of average directions from previous iterations. Benchmark studies demonstrate SOAP’s superior performance, showing faster convergence and enhanced noise robustness compared to traditional optimization methods. The method’s scalability has been validated through numerical simulations of up to 20 qubits, and its practical efficacy has been confirmed through experiments on superconducting quantum computers. For simulating electron-phonon systems, we introduce a variational basis state encoding algorithm that significantly reduces resource requirements compared to conventional unary and binary encoding schemes. Our approach achieves smaller scaling than traditional methods for qubits and gates for systems obeying the area law of entanglement entropy, this remarkable reduction in resource requirements comes at the cost of a constant amount of additional measurements. The algorithm’s effectiveness has been validated through both numerical simulations and quantum hardware experiments, demonstrating that using just one or two qubits per phonon mode can produce quantitatively accurate results across various coupling regimes. The integration of these innovations within the TenCirChem library represents a significant advancement in quantum computational chemistry. The software package provides researchers with a comprehensive toolkit for developing, testing, and implementing quantum algorithms, while the novel methods address fundamental challenges in circuit depth, parameter optimization, and resource efficiency. These developments collectively enhance the practicality of quantum computing for addressing real-world chemical problems in the NISQ era, offering improved accuracy, efficiency, and noise robustness.
The Travelling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimisation problem with important industrial applications. Although extensively studied, quantum solutions for instances beyond a dozen locations remain uncommon. We present a hybrid penalty-free Variational Quantum Algorithm (VQA) that significantly reduces both the qubit count and the runtime through a compact penalty-free formulation scaling as O(nlog2n) qubits compared to conventional formulations with O(n2) scaling. The VQA achieves solution qualities exceeding 90\% on Rigetti quantum hardware for instances of up to 17 locations. To the best of our knowledge, this represents the largest TSP instance solved on gate-based hardware. We systematically evaluate multiple encoding and optimisation strategies, and show that warm-start initialisation improves solution quality, while runtime is reduced by nearly two orders of magnitude through the use of gradient-free optimisation methods and cost-function caching. We additionally introduce a novel VQA inspired classical machine learning model (VQAi-CML) and benchmark the VQA against VQAi-CML, a greedy heuristic, a Monte Carlo baseline, and a strong classical optimisation baseline. Across the networks evaluated, the VQA consistently achieves superior solution quality relative to VQAi-CML, greedy heuristic, and Monte Carlo baselines, but not the classical solver