Uniformly Decaying Subspaces for Quantum Computation*

We show that uniformly decaying subspaces can be created in a system of qubits undergoing strong relaxation with different decay rates and can be used to perform analog quantum computation. All expectation values of the dynamics encoded in such a subspace can be re-scaled by a common factor to obtain the dissipationless counterpart upto a small error which depends on the inhomogeneity of the decay rates. We provide a method that ensures that the dynamics can be simulated for times up to the inverse square root of the largest deviation of any decay rate from the mean. The cost of the error-mitigation is paid by taking exponentially more shots in time, and the error can be made arbitrarily small and time arbitrarily long by choosing the operating frequencies of qubits to align their decay rate with that of the fastest decaying qubit.