Related papers: On the sampling complexity of open quantum systems
Controllable systems relying on quantum behavior to simulate distinctly quantum models so far rely on increasingly challenging classical computing to verify their results. We develop a general protocol for confirming that an arbitrary…
We propose a computationally efficient method to solve the dynamics of operators of bosonic quantum systems coupled to their environments. The method maps the operator under interest to a set of complex-valued functions, and its adjoint…
Any real interaction process produces many incompatible system versions, or realisations, giving rise to omnipresent dynamic randomness and universally defined complexity (arXiv:physics/9806002). Since quantum behaviour dynamically emerges…
The parameters of a quantum system grow exponentially with the number of involved quantum particles. Hence, the associated memory requirement goes well beyond the limit of best classic computers for quantum systems composed of a few dozen…
We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement is bounded for any bipartite split along an edge of the tree. This is achieved by expanding the {\em time-evolving block decimation}…
Simulating physical systems on quantum devices is one of the most promising applications of quantum technology. Current quantum approaches to simulating open quantum systems are still practically challenging on NISQ-era devices, because…
It is well known in quantum optics that any process involving the preparation of a multimode gaussian state, followed by a gaussian operation and gaussian measurements, can be efficiently simulated by classical computers. Here, we provide…
The global coupling of few-level quantum systems ("spins") to a discrete set of bosonic modes is a key ingredient for many applications in quantum science, including large-scale entanglement generation, quantum simulation of the dynamics of…
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical…
The paradigm of considering open quantum systems -- i.e. focusing only on the system of interest, and treating the rest of the world as an effective environment -- has proven to be a highly effective way to understand a range of quantum…
Simulating physical systems is a core component of scientific computing, encompassing a wide range of physical domains and applications. Recently, there has been a surge in data-driven methods to complement traditional numerical simulations…
Geometry and dimensionality have played crucial roles in our understanding of the fundamental laws of nature, with examples ranging from curved space-time in general relativity to modern theories of quantum gravity. In quantum many-body…
Tensor network (TN), a young mathematical tool of high vitality and great potential, has been undergoing extremely rapid developments in the last two decades, gaining tremendous success in condensed matter physics, atomic physics, quantum…
Complex systems are characterized by specific time-dependent interactions among their many constituents. As a consequence they often manifest rich, non-trivial and unexpected behavior. Examples arise both in the physical and non-physical…
We develop a recently introduced representation of quantum dynamics based on sampling negative Markov chain processes. By introducing particles and antiparticles, this formalism maps generic quantum dynamics onto a Markov process defined…
Molecular biology and biochemistry interpret microscopic processes in the living world in terms of molecular structures and their interactions, which are quantum mechanical by their very nature. Whereas the theoretical foundations of these…
We initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms…
A software product line models the variability of highly configurable systems. Complete exploration of all valid configurations (the configuration space) is infeasible as it grows exponentially with the number of features in the worst case.…
The fundamental question of how to best simulate quantum systems using conventional computational resources lies at the forefront of condensed matter and quantum computation. It impacts both our understanding of quantum materials and our…
In experimentally realistic situations, quantum systems are never perfectly isolated and the coupling to their environment needs to be taken into account. Often, the effect of the environment can be well approximated by a Markovian master…