Related papers: Quantum Cosmology on Quantum Computer
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is…
Quantum cosmology is studied within the framework of the minimal quantum gravity theory proposed by Ho\v{r}ava. For this purpose we choose the Kantowski-Sachs (KS) model and construct the corresponding Wheeler-DeWitt equation. We study the…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
Solving non-Hermitian quantum many-body systems on a quantum computer by minimizing the variational energy is challenging as the energy can be complex. Here, based on energy variance, we propose a variational method for solving the…
Quantum cosmology has traditionally been studied at the level of symmetry-reduced minisuperspace models, analyzing the behavior of wave functions. However, in the absence of a complete full setting of quantum gravity and detailed knowledge…
We investigate $(n+1)$--dimensional cosmology with varying speed of light. After solving corresponding Wheeler-DeWitt equation, we obtain exact solutions in both classical and quantum levels for ($c $--$\Lambda$)--dominated Universe. We…
The local Hamiltonian (LH) problem, the quantum analog of the classical constraint satisfaction problem, is a cornerstone of quantum computation and complexity theory. It is known to be QMA-complete, indicating that it is challenging even…
This paper provides a prospectus for a new way of thinking about the wavefunction of the universe: a $\Psi$-epistemic quantum cosmology. We present a proposal that, if successfully implemented, would resolve the cosmological measurement…
Principal component analysis is an important dimension reduction technique in machine learning. In [S. Lloyd, M. Mohseni and P. Rebentrost, Nature Physics 10, 631-633, (2014)], a quantum algorithm to implement principal component analysis…
Quantum computing has demonstrated the potential to revolutionize our understanding of nuclear, atomic, and molecular structure by obtaining forefront solutions in non-relativistic quantum many-body theory. In this work, we show that…
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…
We investigate quantum cosmology in teleparallel $f(T)$-gravity. We delve extensively into the minisuperspace description within the context of teleparallelism. The $f(T)$-theory constitutes a second-order theory of gravity, whose…
At large scales, quantum systems may become advantageous over their classical counterparts at performing certain tasks. Developing tools to analyse these systems at the relevant scales, in a manner consistent with quantum mechanics, is…
Perturbation theory in quantum mechanics studies how quantum systems interact with their environmental perturbations. Harmonic perturbation is a rare special case of time-dependent perturbations in which exact analysis exists. Some…
We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer, a method we call variational coherent quantum annealing (VCQA). It involves optimizing the…
Variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithm for the near-term quantum computers. Meanwhile, VQE is confronted with a challenge that statistical error associated with the…
Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This…
The numerical version of the Hamilton-Jacobi quantization method, recently proposed, is applied to the one dimensional quartic oscillator. A suitable quantization condition is formulated and various energy levels and wave functions are…
Partial differential equations (PDEs) are central to computational electromagnetics (CEM) and photonic design, but classical solvers face high costs for large or complex structures. Quantum Hamiltonian simulation provides a framework to…
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…