Quantum physics and computers
Abstract
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit quantum features could factor large composite integers. This task is believed to be out of reach of classical computers as soon as the number of digits in the number to factor exceeds a certain limit. The additional power of quantum computers comes from the possibility of employing a superposition of states, of following many distinct computation paths and of producing a final output that depends on the interference of all of them. This ‘quantum parallelism’ outstrips by far any parallelism that can be thought of in classical computation and is responsible for the ‘exponential’ speed-up of computation. Experimentally, however, it will be extremely difficult to ‘decouple’ a quantum computer from its environment. Noise fluctuations due to the outside world, no matter how little, are sufficient to drastically reduce the performance of these new computing devices. To control the nefarious effects of this environmental noise, one needs to implement efficient error-correcting techniques.
Read the paper
Related studies
- Quantum dots: synthesis, bioapplications, and toxicity
- A Guide to In Silico Drug Design
- Quantum Computing for Healthcare: A Review
- Automated in Silico Design of Homogeneous Catalysts
- Identification of Novel 3-Hydroxy-pyran-4-One Derivatives as Potent HIV-1 Integrase Inhibitors Using in silico Structure-Based Combinatorial Library Design Approach
- In silico structural elucidation of RNA-dependent RNA polymerase towards the identification of potential Crimean-Congo Hemorrhagic Fever Virus inhibitors
Go deeper in Evidence Hub
Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.