[ad_1]
In distinction to classical computer systems, which function on bits that may solely take the essential values 0 and 1, quantum computer systems function on “qubits”, which may assume any superposition of the computational foundation states. Together with quantum entanglement, one other quantum attribute that connects completely different qubits past classical means, this permits quantum computer systems to carry out completely new operations, giving rise to potential benefits in some computational duties, resembling large-scale searches, optimization issues, and cryptography.
The primary problem in direction of placing quantum computer systems into apply stems from the extraordinarily fragile nature of quantum superpositions. Certainly, tiny perturbations induced, as an example, by the ever present presence of an setting give rise to errors that quickly destroy quantum superpositions and, as a consequence, quantum computer systems lose their edge.
To beat this impediment, subtle strategies for quantum error correction have been developed. Whereas they’ll, in principle, efficiently neutralize the impact of errors, they typically include a large overhead in gadget complexity, which itself is error-prone and thus probably even will increase the publicity to errors. As a consequence, full-fledged error correction has remained elusive.
On this work, the researchers leveraged machine studying in a seek for error correction schemes that reduce the gadget overhead whereas sustaining good error correcting efficiency. To this finish, they targeted on an autonomous method to quantum error correction, the place a cleverly designed, synthetic setting replaces the need to carry out frequent error-detecting measurements. In addition they checked out “bosonic qubit encodings”, that are, as an example, out there and utilized in a few of the presently most promising and widespread quantum computing machines based mostly on superconducting circuits.
Discovering high-performing candidates within the huge search area of bosonic qubit encodings represents a posh optimization job, which the researchers deal with with reinforcement studying, a complicated machine studying methodology, the place an agent explores a presumably summary setting to study and optimize its motion coverage. With this, the group discovered {that a} surprisingly easy, approximate qubit encoding couldn’t solely tremendously scale back the gadget complexity in comparison with different proposed encodings, but additionally outperformed its rivals when it comes to its functionality to appropriate errors.
Yexiong Zeng, the primary writer of the paper, says, “Our work not solely demonstrates the potential for deploying machine studying in direction of quantum error correction, however it might additionally carry us a step nearer to the profitable implementation of quantum error correction in experiments.”
In response to Franco Nori, “Machine studying can play a pivotal position in addressing large-scale quantum computation and optimization challenges. At present, we’re actively concerned in numerous tasks that combine machine studying, synthetic neural networks, quantum error correction, and quantum fault tolerance.”
[ad_2]
Source link