En la inform\u00e1tica, la informaci\u00f3n suele representarse por un sistema binario de unos y ceros, y esto se adec\u00faa a la polaridad el\u00e9ctrica. Sin embargo, en nuestra vida cotidiana, usamos un sistema decimal que consta de diez d\u00edgitos para representar n\u00fameros. Existen varias formas de representar la informaci\u00f3n. Las computadoras cu\u00e1nticas actuales han surgido del sistema binario, pero los sistemas f\u00edsicos que codifican sus bits cu\u00e1nticos (qubits) tambi\u00e9n tienen la capacidad de codificar d\u00edgitos cu\u00e1nticos (qubits), en funci\u00f3n de estados de las part\u00edculas de la materia.<\/p>\n
In the realm of computing, information is usually perceived as being represented by a binary system of ones and zeros. However, in our everyday lives, we use a decimal system consisting of ten digits to represent numbers. For instance, the number 9 in binary is represented as 1001, requiring four digits instead of just one in the decimal system.<\/p>\n
<\/span>Today\u2019s quantum computers have emerged from the binary system, but the physical systems that encode their quantum bits (qubits) have the capability to encode quantum digits (qudits) as well. This was recently demonstrated by a team headed by Martin Ringbauer at the\u00a0University of Innsbruck\u2019s<\/a>\u00a0Department of Experimental Physics. According to experimental physicist Pavel Hrmo at\u00a0ETH Zurich<\/a>: \u201cThe challenge for qudit-based quantum computers has been to efficiently create entanglement between the high-dimensional information carriers.\u201d<\/p>\n In a study published on April 19, 2023, in the journal\u00a0Nature Communications<\/span><\/em> the team at the University of Innsbruck now reports, how two qudits can be fully entangled with each other with unprecedented performance, paving the way for more efficient and powerful quantum computers.<\/p>\n Thinking like a quantum computer<\/strong><\/p>\n The example of the number 9 shows that, while humans are able to calculate 9 x 9 = 81 in one single step, a classical computer (or calculator) has to take 1001 x 1001 and perform many steps of binary multiplication behind the scenes before it is able to display 81 on the screen. Classically, we can afford to do this, but in the quantum world where computations are inherently sensitive to noise and external disturbances, we need to reduce the number of operations required to make the most of available quantum computers.<\/p>\n Crucial to any calculation on a quantum computer is quantum entanglement. Entanglement is one of the unique quantum features that underpin the potential for quantum to greatly outperform classical computers in certain tasks. Yet, exploiting this potential requires the generation of robust and accurate higher-dimensional entanglement.<\/p>\n The natural language of quantum systems<\/strong><\/p>\n The researchers at the University of Innsbruck were now able to fully entangle two qudits, each encoded in up to 5 states of individual Calcium ions. This gives both theoretical and experimental physicists a new tool to move beyond binary information processing, which could lead to faster and more robust quantum computers.<\/p>\n Martin Ringbauer explains: \u201cQuantum systems have many available states waiting to be used for\u00a0quantum computing<\/span>, rather than limiting them to work with qubits.\u201d Many of today\u2019s most challenging problems, in fields as diverse as chemistry, physics, or optimization, can benefit from this more natural language of quantum computing.<\/p>\n Reference: \u201cNative qudit entanglement in a trapped ion quantum processor\u201d by Pavel Hrmo, Benjamin Wilhelm, Lukas Gerster, Martin W. van Mourik, Marcus Huber, Rainer Blatt, Philipp Schindler, Thomas Monz and Martin Ringbauer, 19 April 2023,\u00a0Nature Communications<\/em>. The study was funded by the Austrian Science Fund FWF, the Austrian Research Promotion Agency FFG, the European Research Council ERC, the European Union and the Federation of Austrian Industries Tyrol, among others.<\/p>\n
\nDOI: 10.1038\/s41467-023-37375-2<\/a><\/p>\n