JBJack S. Baker

Jack S. Baker

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jack S. Baker has a total of 81 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Designing quantum technologies with a quantum computer

    by Juan Naranjo, Thi Ha Kyaw, Gaurav Saxena, Kevin Ferreira, Jack S Baker

    Interacting spin systems in solids underpin a wide range of quantum technologies, from quantum sensors and single-photon sources to spin-defect-based quantum registers and processors. We develop a quantum-computer-aided framework for simulating such devices using a general many-body electron-spin-resonance Hamiltonian that incorporates zero-field splitting, the Zeeman effect, hyperfine interactions, dipole–dipole spin–spin interactions, and electron-phonon decoherence. Within this framework, we combine gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding (sQKFF) hybrid algorithm, aiming to access extended-time dynamics within the constraints of Noisy Intermediate-Scale Quantum and early fault-tolerant hardware. Numerical simulations demonstrate the computation of operationally useful quantities including autocorrelation functions up to ∼ 100 ns, together with microwave absorption spectra and the ℓ 1 -norm of coherence, achieving 18 % –30 % reductions in gate counts and circuit depth for Trotterized time-evolution circuits compared to unoptimized implementations. Using the nitrogen vacancy center in diamond as a testbed, we benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost. This methodology provides a flexible blueprint for using quantum computers to design, compare, and optimize solid-state spin-qubit technologies under experimentally realistic conditions.

  • Quantum algorithms to identify optically detected magnetic resonance-active defects for quantum sensing applications

    by Pablo A. M. Casares, Yanbing Zhou, Utkarsh Azad, Stepan Fomichev, Jack S. Baker, Chen Ling, Debasish Banerjee, Alain Delgado, Juan Miguel Arrazola

  • Physics-inspired extrapolation for efficient error mitigation and hardware certification

    by Pablo Díez-Valle, Gaurav Saxena, Jack S Baker, Jun-Ho Lee, Thi Ha Kyaw

    Quantum error mitigation (QEM) is essential for the noisy intermediate-scale quantum era, and will remain relevant for early fault-tolerant (EFT) quantum computers, where logical error rates are still significant. However, most QEM methods incur an exponential sampling overhead to achieve unbiased estimates, limiting their practical applicability. Recently, error mitigation by restricted evolution (EMRE) was shown to estimate expectation values with constant sampling overhead, albeit with a small bias that grows with circuit size and noise level. Building upon the EMRE framework, here, we propose physics-inspired extrapolation (PIE), a linear circuit runtime protocol that achieves enhanced accuracy without incurring substantial overhead. Unlike traditional heuristic zero-noise extrapolation methods, PIE provides a theoretical foundation for the operational interpretation of its fitting parameters and demonstrates convergence to unbiased estimates as noise decreases. Distinctively, the slope of the extrapolation fit corresponds to the max-relative entropy between the ideal and noisy circuits, enabling quantitative hardware certification alongside error mitigation, with no additional computational overhead. We also demonstrate the efficacy of this method on IBMQ hardware and apply it to simulate 84-qubit quantum dynamics efficiently. Our results show that PIE yields accurate, low-variance error mitigated estimates, establishing it as a practical and scalable strategy for both error mitigation and hardware certification for near-term and EFT quantum computers.


  • Open Access

    Designing quantum technologies with a quantum computer

    by Juan Naranjo, Thi Ha Kyaw, Gaurav Saxena, Kevin Ferreira, Jack S. Baker

    Interacting spin systems in solids underpin a wide range of quantum technologies, from quantum sensors and single-photon sources to spin-defect-based quantum registers and processors. We develop a quantum-computer-aided framework for simulating such devices using a general electron spin resonance Hamiltonian incorporating zero-field splitting, the Zeeman effect, hyperfine interactions, dipole-dipole spin-spin terms, and electron-phonon decoherence. Within this model, we combine Gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding (sQKFF) hybrid algorithm to access long-time dynamics while remaining compatible with NISQ and early fault-tolerant hardware constraints. Numerical simulations demonstrate the computation of autocorrelation functions up to $\sim100$ ns, together with microwave absorption spectra and the $\ell_1$-norm of coherence, achieving 18-30$\%$ reductions in gate counts and circuit depth for Trotterized time-evolution circuits compared to unoptimized implementations. Using the nitrogen vacancy center in diamond as a testbed, we benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost. This methodology provides a flexible blueprint for using quantum computers to design, compare, and optimize solid-state spin-qubit technologies under experimentally realistic conditions.

  • Open Access

    Universal initial state preparation for first quantized quantum simulations

    by Jack S. Baker, Gaurav Saxena, Thi Ha Kyaw

    Preparing symmetry-adapted initial states is a principal bottleneck in first-quantized quantum simulation. We present a universal approach that efficiently maps any polynomial-size superposition of occupation-number configurations to the first-quantized representation on a digital quantum computer. The method exploits the Jordan--Schwinger Lie algebra homomorphism, which identifies number-conserving second-quantized operators with their first-quantized action and induces an equivariant bijection between Fock occupations and $\mathfrak{su}(d)$ weight states within the Schur--Weyl decomposition. Operationally, we prepare an encoded superposition of Schur labels via a block-encoded linear combination of unitaries and then apply the inverse quantum Schur transform. The algorithm runs in time $\text{poly}(L, N, d, \log ε^{-1})$ for $L$ configurations of $N$ particles over $d$ modes to accuracy $ε$, and applies universally to fermions, bosons, and Green's paraparticles in arbitrary single-particle bases. Resource estimates indicate practicality within leading first-quantized pipelines; statistics-aware or faster quantum Schur transforms promise further reductions.

  • Open Access

    Quantum Resilience: Canadian Innovations in Quantum Error Correction and Quantum Error Mitigation

    by Gaurav Saxena, Jack S. Baker, Pablo Díez Valle, William E. Salazar, Kevin Ferreira, Thi Ha Kyaw

    In celebration of the 2025 International Year of Quantum Science and Technology, this article highlights the pioneering achievements and ongoing innovations in quantum error correction and quantum error mitigation by Canadian institutions, academia and industry alike. Emphasizing Canada's central role in advancing these two related areas, we summarize landmark theoretical breakthroughs, cutting-edge experiments, and emerging techniques aimed at reducing and/or eliminating errors incurred when using a quantum computer. This community-focused overview underscores Canada's leadership in addressing the critical challenge of noise in quantum information science.

  • Simulating optically active spin defects with a quantum computer

    by Jack S. Baker, Pablo A. M. Casares, Modjtaba Shokrian Zini, Jaydeep Thik, Debasish Banerjee, Chen Ling, Alain Delgado, Juan Miguel Arrazola


  • Open Access

    GradDFT. A software library for machine learning enhanced density functional theory

    by Pablo A. M. Casares, Jack S. Baker, Matija Medvidović, Roberto dos Reis, Juan Miguel Arrazola

    Density functional theory (DFT) stands as a cornerstone method in computational quantum chemistry and materials science due to its remarkable versatility and scalability. Yet, it suffers from limitations in accuracy, particularly when dealing with strongly correlated systems. To address these shortcomings, recent work has begun to explore how machine learning can expand the capabilities of DFT: an endeavor with many open questions and technical challenges. In this work, we present GradDFT a fully differentiable JAX-based DFT library, enabling quick prototyping and experimentation with machine learning-enhanced exchange–correlation energy functionals. GradDFT employs a pioneering parametrization of exchange–correlation functionals constructed using a weighted sum of energy densities, where the weights are determined using neural networks. Moreover, GradDFT encompasses a comprehensive suite of auxiliary functions, notably featuring a just-in-time compilable and fully differentiable self-consistent iterative procedure. To support training and benchmarking efforts, we additionally compile a curated dataset of experimental dissociation energies of dimers, half of which contain transition metal atoms characterized by strong electronic correlations. The software library is tested against experimental results to study the generalization capabilities of a neural functional across potential energy surfaces and atomic species, as well as the effect of training data noise on the resulting model accuracy.


  • Weak low-temperature polarity in a PbZrO3 single crystal

    by K. Roleder, G. Catalan, A. M. Glazer, J. S. Baker, J.-H. Ko, F. H. Naqvi, S. B. Junaid, A. Majchrowski, Z. Trybuła, J. Zaręba, et al.

    We report the existence of a low-temperature polar phase in PbZrO3 below 270 K. The temperature dependence of resultant polarization was assigned from pyroelectric current changes measured after poling the single crystal or ceramic in a DC electric field. This was observed in single crystals and ceramics and may have a connection with the presence of polar (ferrielectric) antiphase boundaries inside the antiferroelectric phase. The transition point is demonstrated by changes in domain structure and anomalies in dielectric permittivity and losses in as-grown single crystals and ceramic samples.


  • Open Access

    Quantum Variational Rewinding for Time Series Anomaly Detection

    by Jack Baker, Haim Horowitz, Santosh Radha, Stenio Fernandes, Colin Jones, Noorain Noorani, Vladimir Skavysh, Philippe Lamontagne, Barry Sanders

    Electron dynamics, financial markets and nuclear fission reactors, though seemingly unrelated, all produce observable characteristics evolving with time. Within this broad scope, departures from normal temporal behavior range from academically interesting to potentially catastrophic. New algorithms for time series anomaly detection (TAD) are therefore certainly in demand. With the advent of newly accessible quantum processing units (QPUs), exploring a quantum approach to TAD is now relevant and is the topic of this work. Our approach - Quantum Variational Rewinding, or, QVR - trains a family of parameterized unitary time-devolution operators to cluster normal time series instances encoded within quantum states. Unseen time series are assigned an anomaly score based upon their distance from the cluster center, which, beyond a given threshold, classifies anomalous behaviour. After a first demonstration with a simple and didactic case, QVR is used to study the real problem of identifying anomalous behavior in cryptocurrency market data. Finally, multivariate time series from the cryptocurrency use case are studied using IBM’s Falcon r5.11H family of superconducting transmon QPUs, where anomaly score errors resulting from hardware noise are shown to be reducible by as much as 20% using advanced error mitigation techniques.