paper-with-me

홈 › Papers

A Scalable Quantum Neural Network for Approximate SRBB-Based Unitary Synthesis

2024-12-04 · Giacomo Belli, Marco Mordacci, Michele Amoretti

In this work, a scalable quantum neural network is introduced as a means to approximate any unitary evolution through the Standard Recursive Block Basis (SRBB) and, subsequently, redesigned with a number of CNOTs asymptotically reduced by an exponential contribution. This algebraic approach to the problem of unitary synthesis exploits Lie algebras and their topological features to obtain scalable parameterizations of unitary operators. First, the original SRBB-based scalability scheme, already known in the literature only from a theoretical point of view, is reformulated for efficient algorithm implementation and complexity management. Remarkably, 2-qubit operators emerge as a special case outside the original scaling scheme. Furthermore, an algorithm is proposed to reduce the number of CNOTs, thus deriving a new implementable scaling scheme that requires only one layer of approximation. The scalable CNOT-reduced quantum neural network is implemented and its performance is assessed with a variety of different unitary matrices, both sparse and dense, up to 6 qubits via the PennyLane library. The effectiveness of the approximation is measured with different metrics in relation to two optimizers: a gradient-based method and the Nelder-Mead method. The approximate CNOT-reduced SRBB-based synthesis algorithm is also tested on real hardware and compared with other valid approximation and decomposition methods available in the literature.

📄 PDF Abstract BibTeX arXiv:2412.03083

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

SRBB-Based Quantum State Preparation

2025-03-17 · Giacomo Belli, Marco Mordacci, Michele Amoretti

In this work, a scalable algorithm for the approximate quantum state preparation problem is proposed, facing a challenge of fundamental importance in many topic areas of quantum computing. The algorithm uses a variationa…

Beyond Reinforcement Learning: Fast and Scalable Quantum Circuit Synthesis

2026-02-16 · Lukas Theißinger, Thore Gerlach, David Berghaus, Christian Bauckhage arxiv

Quantum unitary synthesis addresses the problem of translating abstract quantum algorithms into sequences of hardware-executable quantum gates. Solving this task exactly is infeasible in general due to the exponential gr…

Zero-shot GeneralizationReinforcement Learning

Improving Quantum Circuit Synthesis with Machine Learning

2023-06-09 · Mathias Weiden, Ed Younis, Justin Kalloor, John Kubiatowicz 외

In the Noisy Intermediate Scale Quantum (NISQ) era, finding implementations of quantum algorithms that minimize the number of expensive and error prone multi-qubit gates is vital to ensure computations produce meaningful…

Lie Group Diffusion Models for Hardware-Aware Quantum Circuit Synthesis

2026-06-28 · Jyotirmai Singh arxiv

An important task in quantum computing is unitary circuit synthesis compatible with physical hardware constraints. This problem has a natural hybrid structure as local single-qubit gates are continuous variables on the L…

QFlowNet: Fast, Diverse, and Efficient Unitary Synthesis with Generative Flow Networks

2026-03-03 · Inhoe Koo, Hyunho Cha, Jungwoo Lee arxiv

Unitary Synthesis, the decomposition of a unitary matrix into a sequence of quantum gates, is a fundamental challenge in quantum compilation. Prevailing reinforcement learning (RL) approaches are often hampered by sparse…

Reinforcement Learning