arXiv subjects

Angus Mingare

Publications and source records attributed to Angus Mingare.

6 recordsLinked to original sources

arXiv2026

TNASS: Tensor Network Active Space Selection with the Entanglement Feature

The quality of multi-scale modelling techniques in molecular electronic structure calculations, such as embedding and subspace methods, relies upon the chosen active space. The automation of active space selection is vital for ensuring the accuracy, reproducibility, and scalability in such calculations. In this work, we introduce Tensor Network Active Space Selection using the Entanglement Feature. Through the isolation of strongly correlated electrons, this method provides a scalable foundation for embedding methods in multi-scale modelling. By representing the purities of all possible orbital partitions as a Matrix Product State, our method isolates regions of strong electron correlation without requiring manual preselection of target atoms or the calculation of expensive high-order density matrices. The results demonstrate that this approach leads to lower ground state energies and more accurate dipole moments than other fully automated selection schemes such as those based solely on single-orbital entropy or the selection of spatial orbitals around the HOMO/LUMO gap.

physics.chem-ph↗

arXiv2026

Practical Log-Depth Quantum State Preparation and Circuit Verification via Tree Tensor Network Compilation

Matrix product states provide efficient classical descriptions of quantum systems that may be useful as reference states for quantum algorithms such as quantum phase estimation and quantum-selected configuration interaction. Shallow circuit constructions for loading matrix product states onto quantum computers is necessary for this to be practical on near-term hardware. We present a decomposition of matrix product states to log-depth quantum circuits via a simple tree tensor network renormalisation procedure. Our method exposes an explicit parameter which can be used to trade a small amount of fidelity for large savings in circuit depth. We extend this decomposition to the case of matrix product operators allowing us to construct log-depth and ancilla-free circuits to calculate overlaps of the form $\left |\langle\phi|U|\psi\rangle\right |^2$. In particular, we demonstrate an interpretation of these circuits as \emph{verifier circuits} with application to circuit-level device calibration.

quant-ph↗

arXiv2025

Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction

A recent direction in quantum computing for molecular electronic structure sees the use of quantum devices as configuration sampling machines integrated within high-performance computing (HPC) platforms. This appeals to the strengths of both the quantum and classical hardware; where state-sampling is classically hard, the quantum computer can provide computational advantage in the selection of high quality configuration subspaces, while the final molecular energies are evaluated by solving an interaction matrix on HPC and is therefore not corrupted by hardware noise. In this work, we present an algorithm that leverages stochastic Hamiltonian time evolution in Quantum-Selected Configuration Interaction (QSCI), with multireference perturbation theory capturing missed correlations outside the configuration subspace. The approach is validated through a hardware demonstration utilising 42 qubits of an IQM superconducting device to calculate the potential energy curve of the inorganic silane molecule, SiH4 using a 6-31G atomic orbital basis set, under a stretching of the Si-H bond length. We assess the resulting wavefunctions for compactness, a point on which QSCI has previously been criticised. At large separations, where static correlation dominates, we find a configuration space more than 200 times smaller than that obtained from a conventional SCI selection criterion yields comparable energies. We also compare against the best-in-class Heatbath Configuration Interaction algorithm and observe similar wavefunction compactness at convergence. This result is achieved with a configuration sampling scheme that uses the experimental orbital occupancies of a time-evolved quantum state to predict likely single and double excitations away from existing configurations to bias the subspace expansion procedure.

quant-ph↗

arXiv2025

Extending Quantum Computing through Subspace, Embedding and Classical Molecular Dynamics Techniques

The advent of hybrid computing platforms consisting of quantum processing units integrated with conventional high-performance computing brings new opportunities for algorithm design. By strategically offloading select portions of the workload to classical hardware where tractable, we may broaden the applicability of quantum computation in the near term. In this perspective, we review techniques that facilitate the study of subdomains of chemical systems with quantum computers and present a proof-of-concept demonstration of quantum-selected configuration interaction deployed within a multiscale/multiphysics simulation workflow leveraging classical molecular dynamics, projection-based embedding and qubit subspace tools. This allows the technology to be utilised for simulating systems of real scientific and industrial interest, which not only brings true quantum utility closer to realisation but is also relevant as we look forward to the fault-tolerant regime.

quant-ph↗

arXiv2024

Quantum Error Mitigation via Linear-Depth Verifier Circuits

Implementing many important sub-circuits on near-term quantum devices remains a challenge due to the high levels of noise and the prohibitive depth on standard nearest-neighbour topologies. Overcoming these barriers will likely require quantum error mitigation (QEM) strategies. This work introduces the notion of efficient, high-fidelity verifier circuit architectures that we propose for use in such a QEM scheme. We provide a method for constructing verifier circuits for any quantum circuit that is accurately represented by a low-dimensional matrix product operator (MPO). We demonstrate our method by constructing explicit verifier circuits for multi-controlled single unitary gates as well as the quantum Fourier transform (QFT). By transpiling the circuits to a 2D array of qubits, we estimate the crossover point where the verifier circuit is shallower than the circuit itself, and hence useful for QEM. We propose a method of in situ QEM using the verifier circuit architecture. We conclude that our approach may be useful for calibrating quantum sub-circuits to counter coherent noise but cannot correct for the incoherent noise present in current devices.

quant-ph↗

arXiv2023

Quantum utility -- definition and assessment of a practical quantum advantage

Several benchmarks have been proposed to holistically measure quantum computing performance. While some have focused on the end user's perspective (e.g., in application-oriented benchmarks), the real industrial value taking into account the physical footprint of the quantum processor are not discussed. Different use-cases come with different requirements for size, weight, power consumption, or data privacy while demanding to surpass certain thresholds of fidelity, speed, problem size, or precision. This paper aims to incorporate these characteristics into a concept coined quantum utility, which demonstrates the effectiveness and practicality of quantum computers for various applications where quantum advantage -- defined as either being faster, more accurate, or demanding less energy -- is achieved over a classical machine of similar size, weight, and cost. To successively pursue quantum utility, a level-based classification scheme -- constituted as application readiness levels (ARLs) -- as well as extended classification labels are introduced. These are demonstratively applied to different quantum applications from the fields of quantum chemistry, quantum simulation, quantum machine learning, and data analysis followed by a brief discussion.

quant-ph↗