Quantum algorithm simulates complex environments with fewer qubits

Hans Michael Christensen, Johannes Agerskov and Frederik Nathan of the NNF Quantum Computing Programme at the University of Copenhagen have developed a quantum algorithm that represents Gaussian environments as a sequential series of ancillary qubits. The researchers demonstrate their ancilla-train algorithm (ATA) can accurately reproduce the dynamics of complex quantum systems, even those with strongly coupled or non-Markovian environments, a challenge for existing simulation methods.

The algorithm achieves arbitrary accuracy with a resource cost that increases at a low-degree polynomial rate relative to the desired precision. This work opens new avenues for quantum computers to efficiently simulate non-equilibrium and open quantum systems.

Ancilla-Train Algorithm Simulates Non-Markovian Open Quantum Systems

This insight allows for a streamlined approach to simulating complex quantum systems interacting with their environments, a longstanding challenge in quantum physics. The resulting algorithm, termed the ancilla-train algorithm (ATA), efficiently simulates open quantum systems coupled to Gaussian environments regardless of configuration or coupling strength. Unlike existing methods, the ATA is applicable to scenarios with strongly coupled, or non-Markovian, environments, where traditional approximations break down.

This capability extends to systems with multiple environments that are not in equilibrium with each other, and those governed by time-dependent Hamiltonians, broadening the range of solvable problems. The ATA achieves arbitrary accuracy through a standard, modified Trotterized evolution, augmenting each step with a sequence of gates that connect system observables to a series of ancillary qubits.

This means that achieving higher precision does not demand an exponentially increasing number of qubits or computational steps, a significant advantage over other simulation techniques. The researchers have provided rigorous bounds on the algorithm’s accuracy, demonstrating that the simulation error can be reduced to any desired level by adjusting simulation parameters. The ATA’s ability to represent any Gaussian environment as a “train” of ancillary qubits sequentially interacting with the system is a secondary, yet potentially impactful, result of this work.

This representation simplifies the simulation process, allowing for a more efficient allocation of quantum resources. The team’s findings suggest a path toward simulating quantum systems with accuracy and complexity.

Non-Markovian Environments and Open Quantum System Challenges

The ability to model multiple environments simultaneously expands the scope of solvable problems, moving beyond scenarios where environments are in equilibrium with each other. This advancement addresses a limitation of prior quantum algorithms, which often assume a single, equilibrated environment impacting the quantum system. The algorithm’s versatility extends to systems governed by Hamiltonians that change over time, a feature that helps simulate realistic, dynamic processes.

The algorithm’s structure allows for a strictly local system-ancilla coupling, a characteristic that distinguishes it from other methods. It can return thermal states, non-equilibrium steady states and dynamics, while also simulating non-equilibrium baths and time-dependent Hamiltonians. The number of ancillas required scales with the parameters Γτ/ε^2 and Λτ/ε, offering a quantifiable measure of the resource cost.

Ancilla-Train Algorithm (ATA) for Gaussian Environment Simulation

This or ATR, forms the foundation of a newly developed quantum algorithm designed for simulating open quantum systems. The researchers demonstrate that any Gaussian environment, or quantum noise signal, can be represented by this array of qubits interacting with the system in a time-dependent manner dictated by the jump correlator, converging to an exact representation as the separation between qubits approaches zero. This approach offers a potentially more efficient method for handling the intricacies of environmental interactions in quantum simulations.

The ATR’s utility extends beyond simply representing the environment. It directly informs the ancilla-train algorithm (ATA) itself. The algorithm uses this representation to systematically simulate quantum systems coupled to Gaussian environments at any coupling strength, a capability important for modeling realistic physical scenarios.

ATA Implementation: Trotterization with System-Ancilla Coupling

The ancilla-train algorithm (ATA) distinguishes itself from other quantum simulation methods by successfully modeling non-equilibrium problems and generating both dynamics and steady states. Unlike those approaches, the ATA’s resource demands scale linearly with system-bath coupling for a given target accuracy, offering a potential advantage in scenarios where circuit depth is the primary limitation. This scaling behavior suggests a more efficient implementation for certain complex simulations.

The algorithm’s efficiency stems from a specific construction: a finite register of ancillary qubits that allows for bounded error during Trotterization of the system evolution. The number of ancilla qubits required scales linearly with the strength of the interaction between the system and its environment, a key factor in maintaining accuracy. Ancilla qubits only require preparation at the initial Trotter step where they are used, further streamlining the computational process.

Representing Gaussian environments as a train of ancillary qubits is a key insight, enabling simulation through sequential interactions. The ATA’s approach to Trotterization, using second-order schemes defined by Unitaries U_m and V_m, further contributes to its efficiency. These Unitaries, derived from the system and bath Hamiltonians, facilitate the step-by-step simulation of the quantum system’s evolution. “For a given, fixed target accuracy, the additional cost of the ATA is a register ancilla qubits of size scaling linearly with system–bath coupling,” the paper states, highlighting the algorithm’s resource efficiency.

The algorithm can reproduce the true dynamics of such problems at arbitrary accuracy and, for a broad range of problems, only adds a minor resource cost relative to Trotterized time evolution. The algorithm is applicable to problems with strongly coupled, or non-Markovian, environments; problems with multiple environments out of mutual equilibrium; and problems with time-dependent Hamiltonians.

Accuracy and Resource Cost of the Ancilla-Train Algorithm

This construction allows for a time-local coupling, derived from the convolution square root of the bath correlation function, offering a novel approach to modeling environmental influences on quantum dynamics. The pseudocode for the algorithm details a process of loading new ancillas at each step, evolving the system state and then discarding those ancillas no longer needed, streamlining the computational process and minimizing resource demands.

This contrasts favorably with other quantum simulation methods, offering both wider applicability and a potentially simpler implementation, particularly when circuit depth is a limiting factor. Recent independent work appearing in the quantum simulation literature has explored similar ancilla-train constructions, but this algorithm distinguishes itself through its broader reach and potentially more straightforward implementation.

This characteristic is important for long-duration simulations, where the accumulation of computational overhead can become prohibitive. The researchers emphasize that the extra cost of replacing standard Trotterized evolution with the ancilla-train algorithm may be negligible for a broad class of problems, offering a practical pathway toward more efficient quantum simulations of complex systems. The algorithm can achieve accuracy of O(εΓT), returning a system state to within a target error margin.

Representing Gaussian Environments as Qubit Trains

This insight, presented as a secondary result of the work, establishes a rigorous bound on the error incurred when truncating this ancilla train, allowing for approximate representation of any Gaussian environment with a finite number of qubits. The researchers’ construction, termed the ancilla-train representation of Gaussian quantum noise, provides a discrete time-translation symmetry not found in related approaches using harmonic oscillators and orthogonal polynomials.

A recent emergence of similar concepts in open quantum systems literature highlights the growing interest in ancilla-train constructions, though this work diverges by focusing on qubits rather than harmonic oscillators. For specific scenarios involving symmetric power spectral densities, the algorithm reveals an equivalence between the environment and a classical noise signal impacting the system, simplifying the simulation in those cases.

Jump Correlator Defines System-Ancilla Interaction Strength

The ability to accurately model quantum systems interacting with their environment is now bolstered by a newly defined relationship between the environment’s characteristics and the strength of interaction with ancillary qubits. This connection, presented as a secondary result of their work, offers a novel way to translate environmental properties into quantifiable qubit interactions.

This ancilla-train representation converges to an exact simulation of the quantum noise signal as the spacing between ancilla qubits approaches zero, allowing for tunable accuracy. The team demonstrated that truncating this ancilla register to a finite size introduces only a small, controllable error, provided a filtering step is applied to the jump correlator.

This filtering process adjusts for the time discretization inherent in the simulation, ensuring accuracy even with a limited number of ancilla qubits. The researchers detailed in an appendix that this filtering does not significantly increase the interaction rate or correlation timescales, maintaining computational efficiency. The work also establishes a link between quantum and classical noise, revealing that a classical noise signal with Gaussian correlations can be generated by convolving a white noise signal with the jump correlator.

This parallels established classical signal processing techniques, where filtering a white noise signal produces colored noise, but extends the principle to the quantum realm through a non-Markovian collision model. The researchers state, highlighting the core insight behind their approach, that the team proved that the jump correlator can undergo low-pass filtering without substantially altering its key characteristics, an important step for practical implementation.

This filtering process allows for a manageable interaction rate and correlation timescale, simplifying the computational demands of simulating complex quantum systems. The findings open avenues for simulating open quantum systems with greater efficiency and precision, potentially accelerating progress in fields like materials science and drug discovery.

More like this

Quantum Simulation3D traps now host ion crystals for quantum simulation and networking

Quantum Research NewsA quantum walk finds good solutions with only 30 qubits

Quantum PhysicsQuantum walks with atoms offer a quadratic speedup

Quantum AlgorithmsJP Morgan Chase and Quantinuum get fault-tolerant algorithms running