🔬 materials science

Designing quantum technologies with a quantum computer

This paper presents a quantum-computer-aided framework that combines advanced encoding, aggregation, and a hybrid multi-reference selected quantum Krylov fast-forwarding algorithm to efficiently simulate the long-time dynamics of solid-state spin systems, enabling the design and optimization of quantum technologies like nitrogen vacancy centers with reduced circuit complexity on near-term hardware.

Original authors: Juan Naranjo, Thi Ha Kyaw, Gaurav Saxena, Kevin Ferreira, Jack S. Baker

Published 2026-01-30

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Juan Naranjo, Thi Ha Kyaw, Gaurav Saxena, Kevin Ferreira, Jack S. Baker

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to design a new, incredibly sensitive quantum sensor. This sensor relies on tiny defects inside a diamond (specifically, missing carbon atoms replaced by nitrogen, called "NV centers") that act like tiny magnets. To build a better sensor, you need to understand how these tiny magnets wiggle, interact with each other, and get confused by the vibrations of the diamond crystal around them.

The problem? Simulating these wiggles on a regular computer is like trying to predict the weather for a whole year by calculating every single raindrop's path. It takes too long and requires too much power.

This paper proposes a new way to use quantum computers to do this job, but with a special set of "hacks" to make it work on today's imperfect machines. Here is how they did it, explained simply:

1. The Problem: The "Long Hike"

In quantum physics, to see how a system behaves over time, you usually have to take tiny steps (like taking one step every second). To see what happens over 100 nanoseconds (a very short time for us, but an eternity for a quantum system), you need to take millions of steps.

The Analogy: Imagine trying to walk across a continent. If you take one step at a time, checking your map after every single step, you'll never get there before your shoes wear out.
The Paper's Solution: They use a "Fast-Forward" algorithm. Instead of walking every step, they take a few strategic "leaps" and use math to guess where you will end up.

2. The Toolkit: Three Special Hacks

To make this "Fast-Forward" work on current, noisy quantum computers, the authors combined three clever tricks:

The "Gray Code" Map:
Quantum computers speak a different language (qubits) than the atoms they are simulating. The authors used a specific way of translating the atom's energy levels into qubits (called Gray encoding).
- The Analogy: It's like translating a complex novel into a simple comic book. You keep the story the same, but you use fewer words and simpler pictures so the reader (the computer) doesn't get overwhelmed.
The "Commute" Grouping:
The math describing the system is a giant list of instructions. Some instructions can be done at the same time without messing each other up.
- The Analogy: Imagine a kitchen with many chefs. If two chefs need the same oven, they have to wait. But if one is chopping onions and the other is boiling water, they can work simultaneously. The authors grouped their instructions so the computer could "chop and boil" at the same time, saving a huge amount of time and energy.
The "Multi-Reference" Leap (sQKFF):
This is the core of their "Fast-Forward." Instead of just guessing the future based on where you started, they pick several "reference points" (snapshots of the system) to help guide the prediction.
- The Analogy: If you are trying to predict where a lost hiker will be in an hour, looking at just their starting point isn't enough. But if you also look at where they were 5 minutes ago, 10 minutes ago, and 15 minutes ago, you can draw a much better path. The more "snapshots" (reference states) they use, the more accurate the prediction becomes, even if the steps between them are big.

3. What They Tested

They tested this method on three different scenarios involving diamond defects:

One lonely defect.
Three defects working together.
One defect plus some "impurities" (other atoms) nearby.

They asked the quantum computer to simulate how these systems absorb microwave energy (which is how we read their state) and how long they stay "coherent" (how long they stay in a useful quantum state).

4. The Results: What Worked?

Speed and Accuracy: They successfully simulated the systems for up to 100 nanoseconds. This is a long time for quantum simulations.
The "Reference" Secret: They found that the most important factor for accuracy wasn't how small their steps were, but how many reference snapshots they used.
- The Analogy: It's better to have a few good landmarks to guide your way than to take tiny, perfect steps in the wrong direction. Choosing the right "snapshots" mattered more than anything else.
Resource Savings: By using their "Commute Grouping" trick, they reduced the number of operations the computer had to do by 18% to 30%. This is a big deal because current quantum computers are very fragile; doing fewer things means fewer chances for errors.

5. The Bottom Line

The paper shows that we don't need a perfect, futuristic quantum computer to start designing better quantum sensors. By using a "hybrid" approach (mixing quantum calculations with smart classical math tricks) and focusing on picking the right "reference points," we can simulate complex solid-state materials effectively right now.

They didn't build a new sensor in this paper; they built a blueprint and a testing tool that proves we can use today's imperfect machines to design the quantum technologies of tomorrow.

Technical Summary: Designing Quantum Technologies with a Quantum Computer

Problem Statement
Solid-state materials containing spin-active defects, such as nitrogen-vacancy (NV) centers in diamond, are critical for quantum sensors, single-photon sources, and processors. However, modeling these systems is challenging due to complex spin-environment interactions, including zero-field splitting, Zeeman effects, hyperfine couplings, dipole-dipole interactions, and electron-phonon decoherence. Classical simulations often struggle with the many-body nature of these systems, particularly when calculating long-time dynamics (nanoseconds to microseconds) required to determine coherence times and absorption spectra. While digital quantum computers offer a promising alternative, current Noisy Intermediate-Scale Quantum (NISQ) and early fault-tolerant hardware are constrained by limited qubit counts, intrinsic noise, and circuit depth. The central challenge is developing efficient algorithms that can approximate long-time quantum time evolution while minimizing computational resources (gate counts and circuit depth) to remain compatible with current hardware limitations.

Methodology
The authors propose a quantum-computer-aided design framework that simulates interacting spin systems using a general electron spin resonance (ESR) Hamiltonian. The methodology integrates several optimization techniques:

Hamiltonian Modeling: The framework constructs a Hamiltonian incorporating zero-field splitting, Zeeman terms, hyperfine interactions, dipole-dipole spin-spin terms, and a spin-boson model for electron-phonon decoherence. The system is mapped to a spin-1/2 representation using Gray encoding to minimize qubit requirements ( $\lceil \log_2(d) \rceil$ ).
Circuit Optimization: The resulting Hamiltonian, expressed as a sum of Pauli strings, is partitioned into qubit-wise commuting (QWC) groups. This allows for simultaneous diagonalization via single-qubit Clifford rotations, enabling the use of canonical circuits for exponentiating diagonal Pauli strings. This step facilitates optimal reordering of exponentials to cancel adjacent adjoint operations, reducing gate counts and circuit depth.
Multi-Reference Selected Quantum Krylov Fast-Forwarding (sQKFF): To access long-time dynamics without prohibitive circuit depth, the authors employ the sQKFF algorithm. This hybrid approach approximates the time-evolved state $|\psi(t)\rangle$ $∣ ψ (t)⟩$ within a Krylov subspace constructed from a set of reference states.
- Quantum Component: Computes matrix elements of the overlap ( $S$ ) and Hamiltonian ( $H$ ) matrices using Hadamard tests with second-order Trotterization.
- Classical Component: Solves the generalized eigenvalue problem (Schrödinger equation in the Krylov subspace) to determine time-dependent coefficients.
- Reference Selection: Reference states are selected based on measurement probabilities from a short-time evolved state, aiming to capture the relevant features of long-time dynamics.
Property Computation: The framework calculates autocorrelation functions, microwave absorption spectra (via linear response theory and the imaginary part of susceptibility), and the $\ell_1$ -norm of coherence.

Key Contributions

Integrated Framework: A unified approach combining Gray encoding, QWC aggregation, and the sQKFF algorithm specifically tailored for solid-state spin defects under realistic experimental conditions (including phonon baths and impurities).
Resource Reduction: The application of QWC aggregation and Trotterized time-evolution optimization resulted in 18–30% reductions in gate counts and circuit depth compared to unoptimized implementations across all tested configurations.
Long-Time Dynamics: The framework successfully computed autocorrelation functions up to ~100 ns, a timescale often intractable for standard Trotterization on NISQ hardware.
Benchmarking: The method was validated against classical simulations using QuTiP across three distinct NV-center configurations (single NV, three NVs, and NV with $^{14}$ N impurities).

Results

Accuracy: The framework reproduced QuTiP results with high fidelity for microwave absorption spectra and autocorrelation functions. For Configurations 1 and 3, accurate results were maintained up to tens of nanoseconds even with moderate Trotterization errors.
Reference State Sensitivity: The study identified that the selection of reference states is the primary factor governing accuracy at a fixed hardware cost. Increasing the number of reference states ( $R$ ) significantly improved both simulation accuracy and the achievable time span, often more so than reducing the Trotterization error.
Configuration Complexity: While Configuration 2 (larger system size, higher Hamiltonian 1-norm) presented challenges in identifying effective reference states due to sparser information distribution, the framework remained applicable. Configuration 3, despite having additional impurities and dipole-dipole interactions, achieved accuracy comparable to the simpler Configuration 1 when $R=15$ and the Trotter error was minimized.
Coherence Metrics: The $\ell_1$ -norm of coherence was computed efficiently within the Krylov subspace, allowing for the estimation of effective $T_1$ and $T_2$ coherence times without exponential classical overhead.

Significance and Claims
The paper claims that this methodology provides a flexible blueprint for using quantum computers to design, compare, and optimize solid-state spin-qubit technologies. The authors assert that their hybrid approach demonstrates that quantum computers, when combined with optimized simulation techniques, can serve as effective platforms for studying spin-defect dynamics even under the resource constraints of the NISQ era.

The work highlights that while hardware limitations (noise, qubit count) are significant, algorithmic optimizations like sQKFF and QWC aggregation can extend the operational timescales of simulations. The authors modestly conclude that while simulating complex dynamics with non-trivial interactions remains a long-term objective, their results prove the feasibility of such pursuits. They emphasize that the ability to simulate classically intractable configurations is crucial for advancing quantum device engineering. The paper does not claim immediate deployment on real hardware but rather establishes a validated numerical framework that addresses measurement shot overheads and reference state selection as critical areas for future practical implementation.