Open Quantum Brownian Motion (OQBM) was introduced as a scaling limit of discrete-time open quantum walks. This limit defines a new class of quantum Brownian motion, which incorporates both the external and internal degrees of freedom of the Brownian particle. We consider a weakly driven Brownian particle confined in a harmonic potential and dissipatively coupled to a thermal bath. Applying the rotating wave approximation (RWA) to the system-bath interaction Hamiltonian, we derive a completely positive Born-Markov master equation for the reduced dynamics. We express the resulting master equation in the coordinate representation and, utilizing the adiabatic elimination of fast variables, derive a completely positive hybrid quantum-classical master equation that defines OQBM. We illustrate the resulting dynamics using examples of initial Gaussian and non-Gaussian distributions of the OQBM walker. Both examples reveal the emergence of Gaussian distributions in the limiting behavior of the OQBM dynamics, which closely matches that of the standard OQBM. With the help of the obtained OQBM master equation, we derive the equations for the-th moments and the cumulants of the position distribution of the open Brownian walker. We subsequently solve these equations numerically for Gaussian initial distributions across various parameter regimes. Notably, we find that the third-order cumulant is nonzero, indicating that the dynamics' intrinsic generator is non-Gaussian.
Sample-based quantum diagonalization (SQD) offers a powerful route to accurate quantum chemistry on noisy intermediate-scale quantum (NISQ) devices by combining quantum sampling with classical diagonalization. Here we introduce HSQD, a novel half-qubit SQD approach that halves the qubit requirement for simulating a chemical system and drastically reduces overall circuit depth and gate counts, suppressing hardware noise. When modeling the dissociation of the nitrogen molecule with a (10e, 26o) active space, HSQD matches the accuracy of SQD on IBM quantum hardware using only half the number of qubits and 40% fewer measurements. We further enhance HSQD with a heat-bath configuration interaction (HCI) inspired selection of the samples, forming HCI-HSQD. This yields sub-millihartree accuracy across the N2 potential energy surface and produces subspaces up to 39% smaller than those from classical HCI, showing a significant improvement in the compactness of the ground-state representation. Finally, we demonstrate the scalability of HCI-HSQD using iron-sulfur clusters, reaching active spaces of up to (54e, 36o) while using only half as many qubits as the original SQD. For these systems, HCI-HSQD reduces SQD energy errors by up to 76% for [2Fe-2S] and 26% for [4Fe-4S], while also reducing subspace sizes, halving measurement requirements, and eliminating expensive post-processing. Together, these results establish half-qubit SQD as a noise-resilient and resource-efficient pathway toward practical quantum advantage in strongly correlated chemistry.
Spin networks in loop quantum gravity provide a kinematical picture of quantum geometry but lack a natural mechanism for dynamical Dirac-type evolution, while the Wheeler--DeWitt equation typically enters only as an imposed constraint. We propose a stochastic framework in which each spin-network edge carries helicity-resolved amplitudes -- two-state internal labels that undergo Poisson-driven flips. The resulting coupled master equations, after analytic continuation and the introduction of a fundamental length scale, generate Dirac-type dynamics on discrete geometry. At long times, the same process relaxes to helicity-symmetric equilibrium states, which are shown to satisfy a Wheeler--DeWitt-type condition. In this way, both quantum evolution and the gravitational constraint emerge within a single probabilistic framework. Our approach thus provides a background-independent and stochastic route to quantum geometry, offering an alternative to canonical quantization and a fresh perspective on the problem of time.
Over two decades ago, Bruce Kane proposed that spin-half phosphorus nuclei embedded in a spin-zero silicon substrate could serve as a viable platform for spin-based quantum computing. These nuclear spins exhibit remarkably long coherence times, making them ideal candidates for qubits. Despite this advantage, practical realisation of spin quantum computing remains a challenge. More recently, physicist Matthew Fisher proposed a hypothesis linking nuclear spin dynamics, specifically those of phosphorus nuclei within the spin-zero matrix of calcium phosphate molecules, to neural activation and, potentially, cognition. The theory has generated both interest and scepticism, with some fundamental questions remaining. We review this intersection of quantum computing and quantum biology by outlining the similarities between these models of quantum computing and quantum cognition. We then address some of the open questions and the lessons that might be learned in each context. In doing so, we highlight a promising bidirectional exchange: not only might quantum computing offer tools for understanding quantum biology, but biological models may also inspire novel strategies for quantum information processing.
We compare two quantum approaches that use support vector machines for multi-class classification on a reduced Sloan Digital Sky Survey (SDSS) dataset: the quantum kernel-based QSVM and the Harrow-Hassidim-Lloyd least-squares SVM (HHL LS-SVM). Both one-vs-rest and two-step hierarchical classification schemes were implemented. The QSVM involves angle encoding of ten features, two unitary operator blocks consisting of rotational operator gates, and a projective measurement that projects the final state to the zero state. The HHL-based method involves solving a system of linear equations using the HHL algorithm and using the solution in a support vector machine approach. The results indicate that the QSVM outperforms HHL LS-SVM in most cases. HHL LS-SVM performs somewhat competitively in selected cases, particularly when isolating galaxies (majority), however, it also performs poorly in others, especially when isolating QSOs (minority). Comparisons with classical SVMs confirm that quantum and classical methods achieve broadly similar performance, with classical models performing slightly ahead overall. Scaling analysis reveals a trade-off: QSVM performance suffers from quadratic scaling with the number of samples and features, but benefits from explicit feature representation during training, while HHL LS-SVM scales essentially constantly, with moderate fluctuations, but suffers from limited representative elements. The HHL-based method is also highly noise-sensitive. These results suggest that QSVM performs better overall and will perform better on current hardware as well, but that the more efficient scaling of ...
We revisit the Caldeira-Leggett model of quantum Brownian motion with Ohmic spectral density, and derive an additional contribution to the decoherence kernel in a new high-temperature limit at arbitrarily large cut-off frequency. This contribution reveals a novel mechanism for the classicalization of high-frequency quantum fluctuations. We further demonstrate that it leads to a Markovian master equation that is in guaranteed Lindblad form. Our approach considers in detail the behavior of the decoherence kernel at both the initial and final times of the process on the time scale of the bath memory.
We compare a parameterized quantum kernel (pQK) with a quantum leaky integrate-and-fire (QLIF) neuromorphic computing approach that employs either the Victor-Purpura or van Rossum kernel in a spectral clustering task, as well as the classical radial basis function (RBF) kernel. Performance evaluation includes label-based classification and clustering metrics, as well as optimal number of clusters predictions for each dataset based on an elbow-like curve as is typically used in-means clustering. The pQK encodes feature vectors through angle encoding with rotation angles scaled parametrically. Parameters are optimized through grid search to maximize kernel-target alignment, producing a kernel that reflects distances in the feature space. The quantum neuromorphic approach uses population coding to transform data into spike trains, which are then processed using temporal distance metrics. Kernel matrices are used as input into a classical spectral clustering pipeline prior to performance evaluation. For the synthetic datasets and Iris, the QLIF kernel typically achieves better classification and clustering performance than pQK. However, on higher-dimensional datasets, such as a preprocessed version of the Sloan Digital Sky Survey (SDSS), pQK performed better, indicating a possible advantage in higher-dimensional regimes.
Randomized algorithms such as qDRIFT provide an efficient framework for quantum simulation by sampling terms from a decomposition of the system's generator. However, existing error bounds for qDRIFT scale quadratically with the norm of the generator, limiting their efficiency for large-scale closed or open quantum system simulation. In this work, we refine the qDRIFT error bound by incorporating Jensen's inequality and a careful treatment of the integral form of the error. This yields an improved scaling that significantly reduces the number of steps required to reach a fixed simulation accuracy. Our result applies to both closed and open quantum systems, and we explicitly recover the improved bound in the Hamiltonian case. To demonstrate the practical impact of this refinement, we apply it to three settings: quantum chemistry simulations, dissipative transverse field Ising models, and Hamiltonian encoding of classical data for quantum machine learning. In each case, our bound leads to a substantial reduction in gate counts, highlighting its broad utility in enhancing randomized simulation techniques.