mlsanityData to 14 Oct 2026

A Novel Single-Layer Quantum Neural Network for Approximate SRBB-Based Unitary Synthesis

arXiv 2412.03083 ↗First posted 4 Dec 2024quant-ph cs.ET cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In this work, a novel quantum neural network is introduced as a means to approximate any unitary evolution through the Standard Recursive Block Basis (SRBB) and is subsequently redesigned with the 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 of the original scaling scheme. Furthermore, an algorithm is proposed to reduce the number of CNOT gates in the scalable variational quantum circuit, thus deriving a new implementable scaling scheme that requires only one layer of approximation. The single layer 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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 31 references that are in the map. First posted on arXiv 4 Dec 2024.

Builds on

6 of 31 references.

References · 6

  1. 2020Variational Quantum Algorithmscited by 692
  2. 2019Parameterized quantum circuits as machine learning modelscited by 332
  3. 2021Best Approximate Quantum Compiling Problemscited by 8
  4. 2021Efficient decomposition of unitary matrices in quantum circuit compilerscited by 7
  5. 2023Scalable quantum circuits for n-qubit unitary matricescited by 2
  6. 2022Sketching the Best Approximate Quantum Compiling Problemcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.