Related papers: Quantum Algorithms for Realizing Symmetric, Asymme…
Group theory is extremely successful in characterizing the symmetries in quantum systems, which greatly simplifies and unifies our treatments of quantum systems. Here we introduce the concept of the symmetry for a quantum Boltzmann machine…
One of the peculiar features in quantum mechanics is that a superposition of macroscopically distinct states can exits. In optical system, this is highlighted by a superposition of coherent states (SCS), i.e. a superposition of classical…
Standard quantum measurements are projective. However, the full scope of quantum measurements is represented by positive operator-valued measures (POVMs) and many of these break the limitations of projective measurements as resources in…
Quantum sensing encompasses highly promising techniques with diverse applications including noise-reduced imaging, super-resolution microscopy as well as imaging and spectroscopy in challenging spectral ranges. These detection schemes use…
Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it…
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…
We propose a scheme to restore spatial symmetry of Hamiltonian in the variational-quantum-eigensolver (VQE) algorithm for which the quantum circuit structures used usually break the Hamiltonian symmetry. The symmetry-adapted VQE scheme…
Supersymmetry is one of the most important and indispensable ingredients of modern theoretical physics. However, the absence, at least at the time of publishing this review, of experimental verification of supersymmetry in elementary…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
It is known that quantum correlations exhibited by a maximally entangled qubit pair can be simulated with the help of shared randomness, supplemented with additional resources, such as communication, post-selection or non-local boxes. For…
Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum…
We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with…
Quantum circuit mapping is a crucial process in the quantum circuit compilation pipeline, facilitating the transformation of a logical quantum circuit into a list of instructions directly executable on a target quantum system. Recent…
Quantum computing has emerged as a transformative paradigm, capable of tackling complex computational problems that are infeasible for classical methods within a practical timeframe. At the core of this advancement lies the concept of…
Quantum computers theoretically are able to solve certain problems more quickly than any deterministic or probabilistic computers. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, one has to…
Machine Learning algorithms are extensively used in an increasing number of systems, applications, technologies, and products, both in industry and in society as a whole. They enable computing devices to learn from previous experience and…
For quantum search via the continuous-time quantum walk, the evolution of the whole system is usually limited in a small subspace. In this paper, we discuss how the symmetries of the graphs are related to the existence of such an invariant…
Major obstacles remain to the implementation of macroscopic quantum computing: hardware problems of noise, decoherence, and scaling; software problems of error correction; and, most important, algorithm construction. Finding truly quantum…
In this study the determinant of the average quadratic error matrix is used as the measure of state estimation efficiency. This quantity is easily computable in some cases, so it gives us a reasonable tool to find optimal measurement setup…