Osaka and Kyoto researchers boost Pauli Correlation Encoding for quantum optimisation

Started by Ridge, Today at 04:50 PM

Previous topic - Next topic

0 Members and 1 Guest are viewing this topic.

Topic: Osaka and Kyoto researchers boost Pauli Correlation Encoding for quantum optimisation   Views(Read 32 times)
Active members in this topic:
Ridge(1)

Ridge

Here is a more technical quantum story for those who like the detail. Researchers from the University of Osaka and Kyoto University, including Riku Usuki, Don Arai, Ken N. Okada and Keisuke Fujii, have improved a technique called Pauli Correlation Encoding, or PCE. It is a way of tackling combinatorial optimisation problems on quantum hardware with limited numbers of qubits. Their paper is on arXiv under the title Enhancing Pauli Correlation Encoding for quantum optimization via systematic expressivity analysis

PCE works by encoding the variables of an optimisation problem into the expected values of Pauli strings, which are combinations of basic quantum operations across several qubits. The clever part is that this lets a fairly small quantum device represent much larger problems than the usual one variable per qubit approach. That matters a lot while hardware is still limited. It is a neat trick for squeezing more out of limited hardware

The team studied why PCE struggled on bigger problems. They found that the limitation was not the encoding's ability to represent good solutions, but difficulty optimising under the relaxed objective functions normally used. To fix that, they proposed a multistage continuation framework that gradually refines the objective function during training. That kind of diagnosis is often more useful than a headline result

The result was a 15 percent improvement in cut value over standard PCE on challenging graph problems with 800 vertices, a size previously seen as out of reach for this approach. They also showed PCE needs fewer trainable parameters than equivalent classical tensor network models while producing results comparable to sophisticated graph neural networks

It is another example of quantum software and algorithm work moving forward alongside hardware, like Classiq's fault tolerance engine and Rigetti's work with Gurobi. As always with arXiv papers, it has not yet been peer reviewed. Does anyone here work on optimisation problems? And are clever encodings like this the way to squeeze value from today's small quantum machines?

sudo make me a sandwich