Related papers: Connecting Entanglement in Time and Space: Improvi…
Several recent experiments have demonstrated the promise of atomic ensembles for quantum teleportation and quantum memory. In these cases the collective internal state of the atoms is well described by continuous variables $X_1, P_1$ and…
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot…
The demand for classical-quantum hybrid algorithms to solve large-scale combinatorial optimization problems using quantum annealing (QA) has increased. One approach involves obtaining an approximate solution using classical algorithms and…
Structure in quantum entanglement entropy is often leveraged to focus on a small corner of the exponentially large Hilbert space and efficiently parameterize the problem of finding ground states. A typical example is the use of matrix…
Entanglement is one of the most fascinating features arising from quantum-mechanics and of great importance for quantum information science. Of particular interest are so-called hybrid-entangled states which have the intriguing property…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
In closed systems, dynamical symmetries lead to conservation laws. However, conservation laws are not applicable to open systems that undergo irreversible transformations. More general selection rules are needed to determine whether, given…
Entanglement is widely considered the cornerstone of quantum information and an essential resource for relevant quantum effects, such as quantum teleportation, quantum cryptography, or the speed-up of quantum computing, as in Shor's…
Analog quantum simulation is emerging as a powerful tool for uncovering classically unreachable physics such as many-body real-time dynamics. A complete quantification of uncertainties is necessary in order to make precise predictions using…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although…
This paper considers the problem of real-time mode scheduling in linear time-varying switched systems subject to a quadratic cost functional. The execution time of hybrid control algorithms is often prohibitive for real-time applications…
The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to…
Entanglement represents a pure quantum effect involving two or more particles. Spin systems are good candidates for studying this effect and its relation with other collective phenomena ruled by quantum mechanics. While the presence of…
Quantum annealing is typically regarded as a tool for combinatorial optimization, but its coherent dynamics also offer potential for machine learning. We present a model that encodes classical data into an Ising Hamiltonian, evolves it on a…
Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
We apply the computational methodology of phase retrieval to the problem of folding heteropolymers. The ground state fold of the polymer is defined by the intersection of two sets in the configuration space of its constituent monomers: a…
We introduce the concept of embedding quantum simulators, a paradigm allowing the efficient quantum computation of a class of bipartite and multipartite entanglement monotones. It consists in the suitable encoding of a simulated quantum…
Optimization-based falsification employs stochastic optimization algorithms to search for error input of hybrid systems. In this paper we introduce a simple idea to enhance falsification, namely time staging, that allows the time-causal…