SearcharxivSearch

arXiv subjects

Jan-Michael Reiner

Publications and source records attributed to Jan-Michael Reiner.

At least 19 recordsLinked to original sources

Can a Quantum Computer Simulate Nuclear Magnetic Resonance Spectra Better than a Classical One?

The simulation of the spectra measured in nuclear magnetic resonance (NMR) spectroscopy experiments is a computationally non-trivial problem which, due to its natural interpretation as a quantum spin problem, maps in a straightforward way to a quantum computer. As such, it represents a problem for which such a device may provide some practical advantage over traditional computing methods. In order to understand the extent to which such problems may indeed provide examples of useful quantum advantage, it is important to understand the limitations of existing classical simulation methods. In this work, we benchmark our own classical solver designed to study such problems. This solver uses a clustering approximation to achieve a resource scaling which is linear in the total number of nuclear spins in a given molecule, for a fixed cluster size. The success of such an approximation would present a stark repudiation to the common claim that such problems require an exponential scaling of resources, the very claim which makes simulating an NMR spectra a candidate for quantum advantage. Our benchmarking results indicate that our approximation performs well throughout, and even somewhat beyond, the more typical experimental regimes. We discuss what implications this may have for future efforts to demonstrate quantum advantage in the context of NMR.

quant-ph

Quantum algorithms for simulating systems coupled to bosonic modes using a hybrid resonator-qubit quantum computer

Modeling composite systems of spins or electrons coupled to bosonic modes is of significant interest for many fields of applied quantum physics and chemistry. A quantum simulation can allow for the solution of quantum problems beyond classical numerical methods. However, implementing this on existing noisy quantum computers can be challenging due to the mapping between qubits and bosonic degrees of freedom, often requiring a large number of qubits or deep quantum circuits. In this work, we discuss quantum algorithms to solve composite systems by augmenting conventional superconducting qubits with microwave resonators used as computational elements. This enables direct representation of bosonic modes by resonators. We derive efficient algorithms for typical models and propose a device connectivity that allows for feasible scaling of simulations with linear overhead. We also show how the dissipation of resonators can be a useful parameter for modeling continuous bosonic baths. Experimental results demonstrating these methods were obtained on the IQM Resonance cloud platform, based on high-fidelity gates and tunable couplers. These results present the first digital quantum simulation including a computational resonator on a commercial quantum platform.

quant-ph

The domain wall color code

We introduce the domain wall color code, a new variant of the quantum error-correcting color code that exhibits exceptionally high code-capacity error thresholds for qubits subject to biased noise. In the infinite bias regime, a two-dimensional color code decouples into a series of repetition codes, resulting in an error-correcting threshold of 50%. Interestingly, at finite bias, our color code demonstrates thresholds identical to those of the noise-tailored XZZX surface code for all single-qubit Pauli noise channels. The design principle of the code is that it introduces domain walls which permute the code's excitations upon domain crossing. For practical implementation, we supplement the domain wall code with a scalable restriction decoder based on a matching algorithm. The proposed code is identified as a comparably resource-efficient quantum error-correcting code highly suitable for realistic noise.

quant-ph

The Discrete Noise Approximation in Quantum Circuits

When modeling the effects of noise on quantum circuits, one often makes the assumption that these effects can be accounted for by individual decoherence events following an otherwise noise-free gate. In this work, we address the validity of this model. We find that under a fairly broad set of assumptions, this model of individual decoherence events provides a good approximation to the true noise processes occurring on a quantum device during the implementation of a quantum circuit. However, for gates which correspond to sufficiently large rotations of the qubit register, we find that the qualitative nature of these noise terms can vary significantly from the nature of the noise at the underlying hardware level. The bulk of our analysis is directed towards analyzing what we refer to as the separability ansatz, which is an ansatz concerning the manner in which individual quantum operations acting on a quantum system can be approximated. In addition to the primary motivation of this work, we identify several other areas of open research which may benefit from the results we derive here.

quant-ph

A quantum algorithm for solving open system dynamics on quantum computers using noise

In this paper we present a quantum algorithm that uses noise as a resource. The goal of our quantum algorithm is the calculation of operator averages of an open quantum system evolving in time. Selected low-noise system qubits and noisy bath qubits represent the system and the bath of the open quantum system. All incoherent qubit noise can be mapped to bath spectral functions. The form of the spectral functions can be tuned digitally, allowing for the time evolution of a wide range of open-system models at finite temperature. We study the feasibility of this approach with a focus on the solution of the spin-boson model and assume intrinsic qubit noise that is dominated by damping and dephasing. We find that classes of open quantum systems exist where our algorithm performs very well, even with gate errors as high as 1%. In general the presented algorithm performs best if the system-bath interactions can be decomposed into native gates.

quant-ph

Correcting non-independent and non-identically distributed errors with surface codes

A common approach to studying the performance of quantum error correcting codes is to assume independent and identically distributed single-qubit errors. However, the available experimental data shows that realistic errors in modern multi-qubit devices are typically neither independent nor identical across qubits. In this work, we develop and investigate the properties of topological surface codes adapted to a known noise structure by Clifford conjugations. We show that the surface code locally tailored to non-uniform single-qubit noise in conjunction with a scalable matching decoder yields an increase in error thresholds and exponential suppression of sub-threshold failure rates when compared to the standard surface code. Furthermore, we study the behaviour of the tailored surface code under local two-qubit noise and show the role that code degeneracy plays in correcting such noise. The proposed methods do not require additional overhead in terms of the number of qubits or gates and use a standard matching decoder, hence come at no extra cost compared to the standard surface-code error correction.

quant-ph

Post-processing noisy quantum computations utilizing N-representability constraints

We propose and analyze a method for improving quantum chemical energy calculations on a quantum computer impaired by decoherence and shot noise. The error mitigation approach relies on the fact that the one- and two-particle reduced density matrices (1- and 2-RDM) of a chemical system need to obey so-called N-representability constraints. We post-process the result of an RDM measurement by projecting it into the subspace where certain N-representability conditions are fulfilled. Furthermore, we utilize that such constraints also hold in the hole and particle-hole sector and perform projections in these sectors as well. We expand earlier work by conducting a careful analysis of the method's performance in the context of quantum computing. Specifically, we consider typical decoherence channels (dephasing, damping, and depolarizing noise) as well as shot noise due to a finite number of projective measurements. We provide analytical considerations and examine numerically three example systems, \ch{H2}, \ch{LiH}, and \ch{BeH2}. From these investigations, we derive our own practical yet effective method to best employ the various projection options. Our results show the approach to significantly lower energy errors and measurement variances of (simulated) quantum computations.

quant-ph

Describing Trotterized Time Evolutions on Noisy Quantum Computers via Static Effective Lindbladians

We consider the extent to which a Trotterized time evolution implemented on a quantum computer is altered by the presence of decoherence. Given a specific set of assumptions regarding the manner in which noise processes acting on such a device can be modeled at the circuit level, we show how the effects of noise can be reinterpreted as a shift to the dynamics of the original system being simulated. In particular, we find that this shift can be described through the use of static Lindblad noise terms, which act in addition to the original unitary dynamics. The form of these noise terms depends not only on the underlying noise processes occurring on the device, but also on the original unitary dynamics, as well as the manner in which these dynamics are simulated on the device, i.e., the choice of quantum algorithm. We call this effectively simulated open quantum system the noisy algorithm model. Our results are confirmed through numerical analysis.

quant-ph

Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm

The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto a NISQ device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate scalable qubit-mapping solutions for NISQ computation. In this work, a noise-aware heuristic qubit-assignment algorithm (which assigns initial placements for qubits in a quantum algorithm to qubits on a NISQ device, but does not route qubits during the quantum algorithm's execution) is presented and compared against the optimal \textit{brute-force} solution, as well as a trivial qubit assignment, with the aim to quantify the performance of our heuristic qubit-assignment algorithm. We find that for small, connected-graph algorithms, our heuristic-assignment algorithm faithfully lies in between the effective upper and lower bounds given by the brute-force and trivial qubit-assignment algorithms. Additionally, we find that the topological-graph properties of quantum algorithms with over six qubits play an important role in our heuristic qubit-assignment algorithm's performance on NISQ devices. Finally, we investigate the scaling properties of our heuristic algorithm for quantum processors with up to 100 qubits; here, the algorithm was found to be scalable for quantum-algorithms which admit path-like graphs. Our findings show that as the size of the quantum processor in our simulation grows, so do the benefits from utilizing the heuristic qubit-assignment algorithm, under particular constraints for our heuristic algorithm. This work thus characterizes the performance of a heuristic qubit-assignment algorithm with respect to the topological-graph and scaling properties of a quantum algorithm which one may wish to run on a given NISQ device.

quant-ph

Using gradient-based algorithms to determine ground state energies on a quantum computer

Variational algorithms are promising candidates to be implemented on near-term quantum computers. The variational quantum eigensolver (VQE) is a prominent example, where a parametrized trial state of the quantum mechanical wave function is optimized to obtain the ground state energy. In our work, we investigate the variational Hamiltonian Ansatz (VHA), where the trial state is given by a non-interacting reference state modified by unitary rotations using generators that are part of the Hamiltonian describing the system. The lowest energy is obtained by optimizing the angles of those unitary rotations. A standard procedure to optimize the variational parameters is to use gradient-based algorithms. However, shot noise and the intrinsic noise of the quantum device affect the evaluation of the required gradients. We studied how different methods for obtaining the gradient, specifically the finite-difference and the parameter-shift rule, are affected by shot noise and noise of the quantum computer. To this end, we simulated a simple quantum circuit, as well as the 2-site and 6-site Hubbard model.

quant-ph

Observation of separated dynamics of charge and spin in the Fermi-Hubbard model

Strongly correlated quantum systems give rise to many exotic physical phenomena, including high-temperature superconductivity. Simulating these systems on quantum computers may avoid the prohibitively high computational cost incurred in classical approaches. However, systematic errors and decoherence effects presented in current quantum devices make it difficult to achieve this. Here, we simulate the dynamics of the one-dimensional Fermi-Hubbard model using 16 qubits on a digital superconducting quantum processor. We observe separations in the spreading velocities of charge and spin densities in the highly excited regime, a regime that is beyond the conventional quasiparticle picture. To minimize systematic errors, we introduce an accurate gate calibration procedure that is fast enough to capture temporal drifts of the gate parameters. We also employ a sequence of error-mitigation techniques to reduce decoherence effects and residual systematic errors. These procedures allow us to simulate the time evolution of the model faithfully despite having over 600 two-qubit gates in our circuits. Our experiment charts a path to practical quantum simulation of strongly correlated phenomena using available quantum devices.

quant-ph

Preparing symmetry broken ground states with variational quantum algorithms

One of the most promising applications for near term quantum computers is the simulation of physical quantum systems, particularly many-electron systems in chemistry and condensed matter physics. In solid state physics, finding the correct symmetry broken ground state of an interacting electron system is one of the central challenges. The Variational Hamiltonian Ansatz (VHA), a variational hybrid quantum-classical algorithm especially suited for finding the ground state of a solid state system, will in general not prepare a broken symmetry state unless the initial state is chosen to exhibit the correct symmetry. In this work, we discuss three variations of the VHA designed to find the correct broken symmetry states close to a transition point between different orders. As a test case we use the two-dimensional Hubbard model where we break the symmetry explicitly by means of external fields coupling to the Hamiltonian and calculate the response to these fields. For the calculation we simulate a gate-based quantum computer and also consider the effects of dephasing noise on the algorithms. We find that two of the three algorithms are in good agreement with the exact solution for the considered parameter range. The third algorithm agrees with the exact solution only for a part of the parameter regime, but is more robust with respect to dephasing compared to the other two algorithms.

quant-ph

Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors

A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of reach. Hence, the finite error rate limits the use of quantum computers to algorithms with a low number of gates. The variational Hamiltonian ansatz (VHA) has been shown to produce the ground state in good approximation in a manageable number of steps. Here we study explicitly the effect of gate errors on its performance. The VHA is inspired by the adiabatic quantum evolution under the influence of a time-dependent Hamiltonian, where the - ideally short - fixed Trotter time steps are replaced by variational parameters. The method profits substantially from quantum variational error suppression, e.g., unitary quasi-static errors are mitigated within the algorithm. We test the performance of the VHA when applied to the Hubbard model in the presence of unitary control errors on quantum computers with realistic gate fidelities.

quant-ph

Quantum simulation of the spin-boson model with a microwave circuit

We consider superconducting circuits for the purpose of simulating the spin-boson model. The spin-boson model consists of a single two-level system coupled to bosonic modes. In most cases, the model is considered in a limit where the bosonic modes are sufficiently dense to form a continuous spectral bath. A very well known case is the ohmic bath, where the density of states grows linearly with the frequency. In the limit of weak coupling or large temperature, this problem can be solved numerically. If the coupling is strong, the bosonic modes can become sufficiently excited to make a classical simulation impossible. Here, we discuss how a quantum simulation of this problem can be performed by coupling a superconducting qubit to a set of microwave resonators. We demonstrate a possible implementation of a continuous spectral bath with individual bath resonators coupling strongly to the qubit. Applying a microwave drive scheme potentially allows us to access the strong-coupling regime of the spin-boson model. We discuss how the resulting spin relaxation dynamics with different initialization conditions can be probed by standard qubit-readout techniques from circuit quantum electrodynamics.

quant-ph

Effects of gate errors in digital quantum simulations of fermionic systems

Digital quantum simulations offer exciting perspectives for the study of fermionic systems such as molecules or lattice models. However, with quantum error correction still being out of reach with present-day technology, a non-vanishing error rate is inevitable. We study the influence of gate errors on simulations of the Trotterized time evolution of the quantum system with focus on the fermionic Hubbard model. Specifically, we consider the effect of stochastic over-rotations in the applied gates. Depending on the particular algorithm implemented such gate errors may lead to a time evolution that corresponds to a disordered fermionic system, or they may correspond to unphysical errors, e.g., violate particle number conservation. We substantiate our analysis by numerical simulations of model systems. In addition we establish the relation between the gate fidelity and the strength of the over-rotations in a Trotterized quantum simulation. Based on this we provide estimates for the maximum number of Trotter steps which can be performed with sufficient accuracy for a given algorithm. This in turn implies, apart from obvious limitations on the maximum time of the simulation, also limits on the system size which can be handled.

quant-ph

Reconstructing the ideal results of a perturbed analog quantum simulator

Well-controlled quantum systems can potentially be used as quantum simulators. However, a quantum simulator is inevitably perturbed by coupling to additional degrees of freedom. This constitutes a major roadblock to useful quantum simulations. So far there are only limited means to understand the effect of perturbation on the results of quantum simulation. Here, we present a method which, in certain circumstances, allows for the reconstruction of the ideal result from measurements on a perturbed quantum simulator. We consider extracting the value of the correlator $\langle\hat{O}^i(t) \hat{O}^j(0)\rangle$ from the simulated system, where $\hat{O}^i$ are the operators which couple the system to its environment. The ideal correlator can be straightforwardly reconstructed by using statistical knowledge of the environment, if any $n$-time correlator of operators $\hat{O}^i$ of the ideal system can be written as products of two-time correlators. We give an approach to verify the validity of this assumption experimentally by additional measurements on the perturbed quantum simulator. The proposed method can allow for reliable quantum simulations with systems subjected to environmental noise without adding an overhead to the quantum system.

quant-ph

Emulating the one-dimensional Fermi-Hubbard model by a double chain of qubits

The Jordan-Wigner transformation maps a one-dimensional spin-1/2 system onto a fermionic model without spin degree of freedom. A double chain of quantum bits with XX and ZZ couplings of neighboring qubits along and between the chains, respectively, can be mapped on a spin-full 1D Fermi-Hubbard model. The qubit system can thus be used to emulate the quantum properties of this model. We analyze physical implementations of such analog quantum simulators, including one based on transmon qubits, where the ZZ interaction arises due to an inductive coupling and the XX interaction due to a capacitive interaction. We propose protocols to gain confidence in the results of the simulation through measurements of local operators.

quant-ph

Estimating the error of an analog quantum simulator by additional measurements

We study an analog quantum simulator coupled to a reservoir with a known spectral density. The reservoir perturbs the quantum simulation by causing decoherence. The simulator is used to measure an operator average, which cannot be calculated using any classical means. Since we cannot predict the result, it is difficult to estimate the effect of the environment. Especially, it is difficult to resolve whether the perturbation is small or if the actual result of the simulation is in fact very different from the ideal system we intend to study. Here, we show that in specific systems a measurement of additional correlators can be used to verify the reliability of the quantum simulation. The procedure only requires additional measurements on the quantum simulator itself. We demonstrate the method theoretically in the case of a single spin connected to a bosonic environment.

quant-ph