In this work, we simulate the behavior of photons in a laboratory experiment using a quantum computer and examine how the simulation results compare with the theoretical predictions. The experiment involves both protective and non-protective measurements. While the latter involves complete wavefunction collapse, the former combines weak interactions with a protective mechanism thereby preserving the photon wave function coherence until its final detection. The simulation gives insights as to how efficient quantum computers can be in simulating actual physical systems as the amount of computation increases.
Arising from a series of laboratory class experiments developed by the authors this book provides an overview of fundamental experiments that can be used to practically demonstrate the underlying principles of quantum physics and quantum information science. Designed with multiple readerships in mind, it will be essential for the professor who would like to recreate a similar suite of experiments for their students and students of physics, who would like to learn how such experiments are actually conducted. Computer scientists, photonics engineers and electrical engineers who would like to foray into quantum technologies would also find this narrative useful to learn about the terminology, key postulates of quantum physics, the collapse of states on measurement and how quantum computers could be implemented. Video Abstract: Simple do-it-yourself experimental set-up for electron chargeqe measurement
Quantum simulation involves using a quantum system to study another quantum system. The proposal to simulate quantum physics using quantum mechanical devices, as outlined by Richard Feynman in 1982, stems from classical computers' challenges in simulating quantum systems. The pursuit of simulating complex quantum systems has led to the intersection of quantum mechanics and quantum computing. This offers new opportunities to understand and manipulate the quantum world. Central to describing quantum dynamics is the Hamiltonian operator
H^, which governs the time evolution of physical systems and serves as the mathematical foundation for quantum simulations. This thesis explores the methodologies and advancements in simulating Hamiltonian operators on quantum computers, focusing on decomposing these operators into quantum gates and the efficiency gains over classical computational approaches. Initially, the thesis explains the fundamental theory and basics of quantum computing. Further it dives into the foundations of the Hamiltonian operator within quantum mechanics, highlighting its role in describing the dynamics of quantum systems. The complexity and high-dimensional nature of Hamiltonian matrices necessitate using quantum computers to simulate quantum phenomena accurately and efficiently. The process of simulating the Hamiltonian operator on a quantum computer involves a detailed examination of the strategies for decomposing the operator into a sequence of quantum gates. This decomposition is crucial for translating the abstract mathematical description of quantum systems into the physical operations of a quantum computer. By utilizing the principles of quantum mechanics, such as superposition and entanglement, quantum gates manipulate qubits to mimic the evolution of quantum states as the Hamiltonian operator dictates. Latter portions of the thesis are dedicated to comparing the efficiency of quantum simulations against traditional classical simulations and inspecting efficient quantum simulations. Quantum computers offer a polynomial or an exponential speedup for certain classes of problems, such as those involving highly entangled quantum states or requiring the simulation of complex quantum dynamics. This advantage is due to the quantum computer's ability to naturally represent and process quantum information - a task for which classical computers require exponential resources as the system size increases. The efficiency of simulating the Hamiltonian operator on a quantum computer is further enhanced through optimization techniques and algorithmic improvements. These include error mitigation strategies and the development of quantum algorithms tailored to specific types of Hamiltonian operators. The thesis presents a comprehensive analysis of these methods, demonstrating how they make quantum simulations more practical and accessible for scientific research and technological development. In conclusion this thesis is a literature review that examines the transformative potential of quantum simulations. By efficiently simulating the Hamiltonian operator on quantum computers researchers can explore quantum phenomena with precision, paving the way for breakthroughs in quantum physics, materials science, and beyond. The advancements in quantum computing technology and algorithmic approaches discussed here highlight the current capabilities and future explorations in the quantum realm.
Summary form only given. Measurements are the very basis of Physics, especially in Quantum Mechanics, where they assume even a more fundamental role because of wave function collapse after a “strong” (projective) measurement. Furthermore, measuring a quantum-mechanical observable completely erases the information on its conjugate one (e.g. measurement of position erases information on momentum, and vice-versa). Nevertheless, in Quantum Mechanics other kinds of measurement are possible. For example, wave function collapse can be overcome through Weak Measurements, i.e. measurements performed with an interaction sufficiently weak not to collapse the original state, featuring several interesting properties. An example of these are weak values [1-3], realised for the first time in [4-6], that have been used for addressing fundamental questions [7-12] as Contextuality and are also a tool for Quantum Metrology [13-19]. One of the most intriguing properties of Weak Measurements is that, since they are not affected by wave function collapse, they can allow gathering simultaneous information on non-commuting observables [20], impossible with the standard (projective) measurement protocols. A second example is offered by Protective Measurements [21], a new technique able to extract information on the expectation value of an observable even measuring a single particle. In this talk, after a general introduction to WMs, we present the first realisation of sequential weak value measurements [22], i.e. a joint measurement of the weak value of (incompatible) polarizations on a single photon. Then, we present an experiment addressed to explore the connection between anomalous weak values and Contextuality [23], showing a clear violation of the inequality proposed in [12] while satisfying all the additional theoretical requests, unequivocally demonstrating the contextual nature of weak values. Finally, we present and discuss the first implementation of Protective Measurements, showing unprecedented measurement capability and demonstrating how the expectation value of an observable can be obtained with a single measurement on a single particle.
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.