Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSimulating Factorization with a Quantum Computer
265
0
0.0
(
0
)
Added by
Jose Luis Rosales B. JLRB
Publication date
2015
fields
Physics
and research's language is
English
Authors
Jose Luis Rosales
Ask ChatGPT about the research
No Arabic abstract
Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum computer would eventually weaken these algorithms. In this paper, one follows Feynmans prescription for a computer to simulate the physics corresponding to the algorithm of factoring a large number $N$ into primes. Using Dirac-Jordan transformation theory one translates factorization into the language of quantum hermitical operators, acting on the vectors of the Hilbert space. This leads to obtaining the ensemble of factorization of $N$ in terms of the Euler function $varphi(N)$, that is quantized. On the other hand, considering $N$ as a parameter of the computer, a Quantum Mechanical Prime Counting Function $pi_{QM}(x)$, where $x$ factorizes $N$, is derived. This function converges to $pi(x)$ when $Ngg x$. It has no counterpart in analytic number theory and its derivation relies on semiclassical quantization alone.
rate research
Read More
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are significant because they are the first to have time-complexities that are comparable to the best known methods for simulating time-independent Hamiltonian evolution, given appropriate smoothness criteria on the Hamiltonian are satisfied. We provide a thorough cost analysis of these algorithms that considers discretizion errors in both the time and the representation of the Hamiltonian. In addition, we provide the first upper bounds for the error in Lie-Trotter-Suzuki approximations to unitary evolution operators, that use adaptively chosen time steps.
We develop a workflow to use current quantum computing hardware for solving quantum many-body problems, using the example of the fermionic Hubbard model. Concretely, we study a four-site Hubbard ring that exhibits a transition from a product state to an intrinsically interacting ground state as hopping amplitudes are changed. We locate this transition and solve for the ground state energy with high quantitative accuracy using a variational quantum algorithm executed on an IBM quantum computer. Our results are enabled by a variational ansatz that takes full advantage of the maximal set of commuting $mathbb{Z}_2$ symmetries of the problem and a Lanczos-inspired error mitigation algorithm. They are a benchmark on the way to exploiting near term quantum simulators for quantum many-body problems.
Limited quantum memory is one of the most important constraints for near-term quantum devices. Understanding whether a small quantum computer can simulate a larger quantum system, or execute an algorithm requiring more qubits than available, is both of theoretical and practical importance. In this Letter, we introduce cluster parameters $K$ and $d$ of a quantum circuit. The tensor network of such a circuit can be decomposed into clusters of size at most $d$ with at most $K$ qubits of inter-cluster quantum communication. We propose a cluster simulation scheme that can simulate any $(K,d)$-clustered quantum circuit on a $d$-qubit machine in time roughly $2^{O(K)}$, with further speedups possible when taking more fine-grained circuit structure into account. We show how our scheme can be used to simulate clustered quantum systems -- such as large molecules -- that can be partitioned into multiple significantly smaller clusters with weak interactions among them. By using a suitable clustered ansatz, we also experimentally demonstrate that a quantum variational eigensolver can still achieve the desired performance for estimating the energy of the BeH$_2$ molecule while running on a physical quantum device with half the number of required qubits.
Forthcoming exascale digital computers will further advance our knowledge of quantum chromodynamics, but formidable challenges will remain. In particular, Euclidean Monte Carlo methods are not well suited for studying real-time evolution in hadronic collisions, or the properties of hadronic matter at nonzero temperature and chemical potential. Digital computers may never be able to achieve accurate simulations of such phenomena in QCD and other strongly-coupled field theories; quantum computers will do so eventually, though Im not sure when. Progress toward quantum simulation of quantum field theory will require the collaborative efforts of quantumists and field theorists, and though the physics payoff may still be far away, its worthwhile to get started now. Todays research can hasten the arrival of a new era in which quantum simulation fuels rapid progress in fundamental physics.
Gauge theories are the most successful theories for describing nature at its fundamental level, but obtaining analytical or numerical solutions often remains a challenge. We propose an experimental quantum simulation scheme to study ground state properties in two-dimensional quantum electrodynamics (2D QED) using existing quantum technology. The proposal builds on a formulation of lattice gauge theories as effective spin models in arXiv:2006.14160, which reduces the number of qubits needed by eliminating redundant degrees of freedom and by using an efficient truncation scheme for the gauge fields. The latter endows our proposal with the perspective to take a well-controlled continuum limit. Our protocols allow in principle scaling up to large lattices and offer the perspective to connect the lattice simulation to low energy observable quantities, e.g. the hadron spectrum, in the continuum theory. By including both dynamical matter and a non-minimal gauge field truncation, we provide the novel opportunity to observe 2D effects on present-day quantum hardware. More specifically, we present two Variational Quantum Eigensolver (VQE) based protocols for the study of magnetic field effects, and for taking an important first step towards computing the running coupling of QED. For both instances, we include variational quantum circuits for qubit-based hardware, which we explicitly apply to trapped ion quantum computers. We simulate the proposed VQE experiments classically to calculate the required measurement budget under realistic conditions. While this feasibility analysis is done for trapped ions, our approach can be easily adapted to other platforms. The techniques presented here, combined with advancements in quantum hardware pave the way for reaching beyond the capabilities of classical simulations by extending our framework to include fermionic potentials or topological terms.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
