相关论文: Complexity and efficiency of minimum entropy produ…

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two…

Quantum transport plays a central role in both fundamental physics and the development of quantum technologies. While significant progress has been made in understanding transport phenomena in quantum systems, methods for optimizing…

Quantifying the complexity of quantum states that possess intrinsic structure, such as symmetry or encoding, in a fair manner constitutes a core challenge in the benchmarking of quantum technologies. This paper introduces the…

Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…

In this work, we introduce a new way to quantify information flow in quantum systems, especially for parameterized quantum circuits. We use a graph representation of the circuits and propose a new distance metric using the mutual…

The number of defects which are generated on crossing a quantum phase transition can be minimized by choosing properly designed time-dependent pulses. In this work we determine what are the ultimate limits of this optimization. We discuss…

Transition states and minimum energy paths are essential to understand and predict chemical reactivity. Double-ended methods represent a standard approach for their determination. We introduce a new double-ended method that optimizes…

Entropic optimal transport (EOT) presents an effective and computationally viable alternative to unregularized optimal transport (OT), offering diverse applications for large-scale data analysis. In this work, we derive novel statistical…

Networked control strategies based on limited information about the plant model usually results in worse closed-loop performance than optimal centralized control with full plant model information. Recently, this fact has been established by…

Molecular dynamics simulations yield large amounts of trajectory data. For their durable storage and accessibility an efficient compression algorithm is paramount. State of the art domain-specific algorithms combine quantization, Huffman…

We derive a fluid-dynamic model for electron transport near a Dirac point in graphene. The derivation is based on the minimum entropy principle, which is exploited in order to close fluid-dynamic equations for quantum mixed states. To this…

The advantages of quantum information processing are in many cases obtained as consequences of quantum interactions, especially for computational tasks where two-qubit interactions are essential. In this work, we establish the framework of…

We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures -- we refer to it as entanglement circulation. The procedure involves optimization…

Information engines harness measurement and feedback to convert energy into useful work. In this study, we investigate the fundamental trade-offs between ergotropic output power, thermodynamic efficiency and information-to-work conversion…

Executing quantum algorithms over distributed quantum systems requires quantum circuits to be divided into sub-circuits which communicate via entanglement-based teleportation. Naively mapping circuits to qubits over multiple quantum…

Many current and near-future applications of quantum computing utilise parametric families of quantum circuits and variational methods to find optimal values for these parameters. Solving a quantum computational problem with such…

We consider the problem of learning the Hamiltonian of a quantum system from estimates of Gibbs-state expectation values. Various methods for achieving this task were proposed recently, both from a practical and theoretical point of view.…

In addition to the Riemannian metricization of the thermodynamic state space, local relaxation times offer a natural time scale, too. Generalizing existing proposals, we relate {\it thermodynamic} time scale to the standard kinetic…

In this research we present a quantum circuit for estimating algorithmic complexity using the coding theorem method. This accelerates inferring algorithmic structure in data for discovering causal generative models. The computation model is…

The task of finding optimal protocols that minimize the energetic cost of thermodynamic processes of long yet finite duration $\tau$ is a pressing one. We approach this problem here in a rigorous and systematic fashion by means of the…