Quantum simulations consist in the reproduction of the dynamics of a quantum systemon a controllable platform, with the goal of capturing an interesting feature of the considered model. It is broadly believed that the advent of quantum simulators will represent a technological revolution, as they promise to solve several problems whichare considered intractable in a classical computer. Although there are strong theoretical bases confirming this claim, several aspects of quantum simulators have still to bestudied, in order to faith fully prove their feasibility. More over, the general question on which features of the considered models are simulatable is an attractive research topic,whose study would help to define the limits of a quantum simulator.In this Thesis, we develop several algorithms, which are able to catch relevant properties of the simulated quantum model. The proposed protocols follow a new concept named embedding quantum simulator, in which the simulated Schrodinger equation is mapped onto an enlarged Hilbert space in a nontrivial way. Via this embedding, weare able to retrieve, by measuring few observables, quantities that generally require full tomography in order to be evaluated. Moreover, we pay a special attention to the experimental feasibility, defining mappings which are space efficient, and do not require the implementation of challenging Hamiltonians. The presented algorithms are general,and they may be implemented in several quantum platforms, e.g. photonics, trappedions, circuit QED, among others.First, we propose a protocol which simulate the dynamics of an embedded Hamiltonian,allowing for the efficient extraction of a class of entanglement monotones. This is done using an embedding that is able to implement unphysical operations, as is the case of complex conjugation. The analysis is accompanied with a study of feasibility in a trapped-ion setup, which can be generalised to other platforms following similar computational models. Second, we propose an algorithm to measure n-time correlation functions of spinorial, fermionic, and bosonic operators, by considerably improving previous versions of the same result. We apply this protocol to the computation of magnetic susceptibilities, as well as to the simulation of Markovian and non-Markovian dissipative processes in a novel way, without the necessity of engineering any bath. All the proposed protocols are designed with a single ancillary qubit, minimising the needed experimental resources.We believe that embedding quantum simulators have a potential to become a powerful tool in the quantum simulation theory, since they pave the way for improving the flexibility of a quantum simulator in diferent experimental contexts.
Measuring entanglement is a demanding task that usually requires full tomography of a quantum system, involving a number of observables that grows exponentially with the number of parties. Recently, it was suggested that adding a single ancillary qubit would allow for the efficient measurement of concurrence, and indeed any entanglement monotone associated with antilinear operations. Here, we report on the experimental implementation of such a device-an embedding quantum simulator-in photonics, encoding the entangling dynamics of a bipartite system into a tripartite one. We show that bipartite concurrence can be efficiently extracted from the measurement of merely two observables, instead of 15, without full tomographic information.
We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted. This result implies that, in order for a quantum computation to achieve a significant speed-up with respect to classical computations, the amount of entanglement (correlations) in a quantum computer cannot be upper bounded, but must scale with the size of the computation. On a practical side, the proposed scheme may be used to simulate the dynamics of certain systems of interest in quantum physics, such as one-dimensional spin models.
We develop a framework for simulating measure-preserving, ergodic dynamical systems on a quantum computer. Our approach provides an operator-theoretic representation of classical dynamics by combining ergodic theory with quantum information science. The resulting quantum embedding of classical dynamics (QECD) enables efficient simulation of spaces of classical observables with exponentially large dimension using a quadratic number of quantum gates. The QECD framework is based on a quantum feature map that we introduce for representing classical states by density operators on a reproducing kernel Hilbert space,
H. Furthermore, an embedding of classical observables into self-adjoint operators on
H is established, such that quantum mechanical expectation values are consistent with pointwise function evaluation. In this scheme, quantum states and observables evolve unitarily under the lifted action of Koopman evolution operators of the classical system. Moreover, by virtue of the reproducing property of
H, the quantum system is pointwise-consistent with the underlying classical dynamics. To achieve a quantum computational advantage, we project the state of the quantum system onto a finite-rank density operator on a
2n-dimensional tensor product Hilbert space associated with
n qubits. By employing discrete Fourier-Walsh transforms of spectral functions, the evolution operator of the finite-dimensional quantum system is factorized into tensor product form, enabling implementation through an
n-channel quantum circuit of size
O(n) and no interchannel communication. Furthermore, the circuit features a state preparation stage, also of size
O(n), and a quantum Fourier transform stage of size
O(n2), which makes predictions of observables possible by measurement in the standard computational basis. We prove theoretical convergence results for these predictions in the large-qubit limit, $n\ensuremath{\rightarrow}\ensuremath{\infty}$. In light of these properties, QECD provides a consistent simulator of the evolution of classical observables, realized through projective quantum measurement, which is able to simulate spaces of classical observables of dimension
2n using circuits of size
O(n2). We demonstrate the consistency of the scheme in prototypical dynamical systems involving periodic and quasiperiodic oscillators on tori. These examples include simulated quantum circuit experiments in Qiskit Aer, as well as actual experiments on the IBM Quantum System One.
This paper presents a novel computational framework, "Multi-Quantum Entanglement Computation," designed to accelerate and optimize complex quantum computations. The core concept revolves around leveraging the unique properties of multi-quantum entanglement to enhance computational efficiency and explore novel applications of quantum computing. This framework introduces a dynamic entanglement scheme that adapts to the specific requirements of each quantum algorithm, improving performance across a range of tasks. The research explores the potential of multi-quantum entanglement to overcome limitations inherent in existing quantum computation methods, paving the way for more efficient and versatile quantum algorithms.