Quantum Fredkin Gate created which is usable for implementing Shor’s algorithm for decryption

Researchers from Griffith University and the University of Queensland have overcome one of the key challenges to quantum computing by simplifying a complex quantum logic operation. They demonstrated this by experimentally realizing a challenging circuit — the quantum Fredkin gate — for the first time.

“The allure of quantum computers is the unparalleled processing power that they provide compared to current technology,” said Dr Raj Patel from Griffith’s Centre for Quantum Dynamics.

An artist’s rendering of the quantum Fredkin (controlled-SWAP) gate, powered by entanglement, operating on photonic qubits. CREDIT Raj Patel and Geoff Pryde, Center for Quantum Dynamics, Griffith University.

The main stumbling block to actually creating a quantum computer has been in minimizing the number of resources needed to efficiently implement processing circuits.

“Similar to building a huge wall out lots of small bricks, large quantum circuits require very many logic gates to function. However, if larger bricks are used the same wall could be built with far fewer bricks,” said Dr Patel.

“We demonstrate in our experiment how one can build larger quantum circuits in a more direct way without using small logic gates.”

At present, even small and medium scale quantum computer circuits cannot be produced because of the requirement to integrate so many of these gates into the circuits. One example is the Fredkin (controlled- SWAP) gate. This is a gate where two qubits are swapped depending on the value of the third.

Usually the Fredkin gate requires implementing a circuit of five logic operations. The research team used the quantum entanglement of photons — particles of light — to implement the controlled-SWAP operation directly.

“There are quantum computing algorithms, such as Shor’s algorithm for factorizing prime numbers, that require the controlled-SWAP operation.

The quantum Fredkin gate can also be used to perform a direct comparison of two sets of qubits (quantum bits) to determine whether they are the same or not. This is not only useful in computing but is an essential feature of some secure quantum communication protocols where the goal is to verify that two strings, or digital signatures, are the same,” said Professor Tim Ralph from the University of Queensland.

SOURCES – Griffith University, Eurekalert

About The Author