Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research proposes a Lie algebra-based algorithm using the Standard Recursive Block Basis (SRBB) hierarchy to efficiently approximate quantum state preparation, significantly reducing CNOT gates and circuit depth compared to full algebraic approaches. By integrating a variational quantum neural network with diagonal SRBB sub-algebras, the method achieves high fidelity in simulations up to 4 qubits while demonstrating practical viability on real quantum hardware. The study highlights the geometric connection between unitary groups and resource-efficient circuit design, offering a promising pathway for scaling variational frameworks in near-term quantum devices.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Quantum State Preparation with the QNN-based SRBB Algorithm

arXiv3 min read

arXiv:2503.13647v2 Announce Type: replace-cross Abstract: In this work, a novel algorithm structured on Lie algebras for the approximate quantum state preparation problem is proposed, addressing a challenge of fundamental importance in many areas of quantum computing. The algorithm uses a variational quantum circuit designed on the Standard Recursive Block Basis (SRBB), a hierarchical construction for the matrix algebra of the $SU(2^n)$ group, which is capable of linking the variational parameters with the topology of the Lie group. Compared to the full algebra, using only diagonal components reduces the number of CNOTs by an exponential factor, as well as the circuit depth, in full agreement with the relaxation principle inherent to the approximation methodology of minimizing resources while achieving high accuracy. The desired quantum state is then approximated by a novel quantum neural network, which is designed based on the diagonal SRBB sub-algebra. This approach provides a new scheme for approximate quantum state preparation in a variational framework and a specific use case for the SRBB hierarchy. The performance of the algorithm is assessed with different loss functions, such as fidelity, trace distance, and Frobenius norm, in relation to two optimizers: Adam and Nelder-Mead. The results highlight the potential of SRBB in close connection with the geometry of unitary groups, achieving high accuracy of up to 4 qubits in simulation, but also its current limitations with an increasing number of qubits. Additionally, the approximate SRBB-based QSP algorithm has been tested on real quantum devices to assess its performance with a small number of qubits.

Abstract:In this work, a novel algorithm structured on Lie algebras for the approximate quantum state preparation problem is proposed, addressing a challenge of fundamental importance in many areas of quantum computing. The algorithm uses a variational quantum circuit designed on the Standard Recursive Block Basis (SRBB), a hierarchical construction for the matrix algebra of the $SU(2^n)$ group, which is capable of linking the variational parameters with the topology of the Lie group. Compared to the full algebra, using only diagonal components reduces the number of CNOTs by an exponential factor, as well as the circuit depth, in full agreement with the relaxation principle inherent to the approximation methodology of minimizing resources while achieving high accuracy. The desired quantum state is then approximated by a novel quantum neural network, which is designed based on the diagonal SRBB sub-algebra. This approach provides a new scheme for approximate quantum state preparation in a variational framework and a specific use case for the SRBB hierarchy. The performance of the algorithm is assessed with different loss functions, such as fidelity, trace distance, and Frobenius norm, in relation to two optimizers: Adam and Nelder-Mead. The results highlight the potential of SRBB in close connection with the geometry of unitary groups, achieving high accuracy of up to 4 qubits in simulation, but also its current limitations with an increasing number of qubits. Additionally, the approximate SRBB-based QSP algorithm has been tested on real quantum devices to assess its performance with a small number of qubits.

Quantum Physics (quant-ph); Machine Learning (cs.LG)

arXiv:2503.13647 [quant-ph]

(or arXiv:2503.13647v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2503.13647 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 343 words

Related coverage