Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Asia Communications and Photonics Conference

Implementation of Large-Scale Arbitrary Linear Unitary Transformation Using Wavefront Matching Algorithm

Shunxin Song, Hongxiang Guo, Guangsong Yuan, Huixin Jia, Peishuo Wang, Peilin Li, Jian Wu

Published Nov 2, 2024• 0 citations
Publisher

Abstract

We propose a matrix characterization and optimization method using the wavefront matching algorithm. Simulation results indicate that this method can achieve a matrix size of$121\times 121$with a fidelity of over 99%.

DOI
10.1109/acp/ipoc63121.2024.10809626

Related papers

Simple measurements and efficient optimization of linear optical networks

Shannon M. Ray, A. Matthew Smith, Daniel Koch +3 more

In this proceeding, we describe a simulated model for the characterization of arbitrary unitary matrices implemented by an reconfigurable linear optical network. We build on the method of Hoch et. al, which itself builds on Liang et. al, for characterizing the arbitrary unitary transformation, U, implemented on such devices as an equivalent real bordered form Urb. We disscuss how the measurement scheme requires fewer and simpler measurements than. We describe a solution that utilizes a novel algorithm to efficiently recover the complex signs of Urb under measurement noise and scaling with system size N.

Quantum Computing, Communication, and Simulation•Mar 19, 2025•0 citations

Manifestation of quantum images using unitary matrix encoding

R. S. Amal, S. Kannan

The European Physical Journal Plus•Apr 9, 2022•1 citation

Efficient optimization for practical characterization of linear optical multiport devices

Shannon M. Ray, A. Matthew Smith, Daniel Koch +3 more

We present a simulated model to study the characterization of arbitrary unitary matrices implemented in an NxN integrated photonic Mach–Zehnder interferometer (MZI) mesh. We extend the measurement method of Hoch et al., which itself generalizes Liang et al., for the practical characterization of an arbitrary unitary transformation, U, implemented on such devices as an equivalent real bordered form Urb. The measurement scheme and reconstruction shown here require fewer and simpler measurements than Liang et al. and are more complete than Hoch et al. Completing the method of Hoch using our hybrid greedy-Tabu and Breadth First Search (BFS) algorithm makes our scheme practical in the sense that only simple classical resources are needed. This allows for practical characterization of the phases of Urb outside of a laboratory setting. We examine the performance of our reconstruction under simulated measurement noise and its scaling in time as a function of system size N.

Optical Engineering•Aug 21, 2025•0 citations

Efficient Computation Techniques and Hardware Architectures for Unitary Transformations in Support of Quantum Algorithm Emulation

Naveed Mahmud, Bennett Haase-Divine, Annika Kuhnke +3 more

Journal of Signal Processing Systems•Jul 14, 2020•19 citations

Three step implementation of any unitary matrix with complete graph of n qubits

Amara Katabarwa, Michael R. Geller

Bulletin of the American Physical Society•Mar 17, 2016•0 citations

Optimization of the HHL Algorithm

Dhruv Sood, Nilmani Mathur, Vikram Tripathi

The Harrow-Hassidim-Lloyd (HHL) algorithm is a quantum algorithm for solving systems of linear equations that, in principle, offers an exponential improvement in scaling with the system size compared to classical approaches. In this work, we investigate the practical implementation and optimisation of the HHL algorithm with a focus on improving its performance on near-term quantum simulators. After outlining the algorithm, we examine two optimisation strategies aimed at improving fidelity and scalability: Suzuki-Trotter decomposition of the Hamiltonian evolution operator and a block-encoding approach that embeds the problem matrix into a larger unitary operator. The performance of these methods is evaluated through simulations on matrices with varying sparsity, including diagonal, tridiagonal, moderately dense, and fully dense cases. Our results show that while HHL achieves near-ideal fidelity for highly structured matrices, performance degrades as sparsity decreases due to the increasing cost of Hamiltonian simulation and reduced post-selection probability due to higher condition number. Block encoding is found to provide improved fidelity for moderately dense matrices, whereas Trotterisation offers a qubit-efficient approach for sparse systems. These results highlight the importance of matrix structure in determining the practical efficiency of HHL and inform future implementations that combine algorithmic optimisation with hardware-aware design.

quant-pharXiv:2603.15756•International Symposium on Lattice Field Theory (LATTICE)•Mar 18, 2026•0 citations
We propose a matrix characterization and optimization method using the wavefront matching algorithm. Simulation results indicate that this method can achieve a matrix size of121×121121\times 121121×121with a fidelity of over 99%.
In this proceeding, we describe a simulated model for the characterization of arbitrary unitary matrices implemented by an reconfigurable linear optical network. We build on the method of Hoch et. al, which itself builds on Liang et. al, for characterizing the arbitrary unitary transformation, U, implemented on such devices as an equivalent real bordered form Urb. We disscuss how the measurement scheme requires fewer and simpler measurements than. We describe a solution that utilizes a novel algorithm to efficiently recover the complex signs of Urb under measurement noise and scaling with system size N.
We present a simulated model to study the characterization of arbitrary unitary matrices implemented in an NxN integrated photonic Mach–Zehnder interferometer (MZI) mesh. We extend the measurement method of Hoch et al., which itself generalizes Liang et al., for the practical characterization of an arbitrary unitary transformation, U, implemented on such devices as an equivalent real bordered form Urb. The measurement scheme and reconstruction shown here require fewer and simpler measurements than Liang et al. and are more complete than Hoch et al. Completing the method of Hoch using our hybrid greedy-Tabu and Breadth First Search (BFS) algorithm makes our scheme practical in the sense that only simple classical resources are needed. This allows for practical characterization of the phases of Urb outside of a laboratory setting. We examine the performance of our reconstruction under simulated measurement noise and its scaling in time as a function of system size N.
The Harrow-Hassidim-Lloyd (HHL) algorithm is a quantum algorithm for solving systems of linear equations that, in principle, offers an exponential improvement in scaling with the system size compared to classical approaches. In this work, we investigate the practical implementation and optimisation of the HHL algorithm with a focus on improving its performance on near-term quantum simulators. After outlining the algorithm, we examine two optimisation strategies aimed at improving fidelity and scalability: Suzuki-Trotter decomposition of the Hamiltonian evolution operator and a block-encoding approach that embeds the problem matrix into a larger unitary operator. The performance of these methods is evaluated through simulations on matrices with varying sparsity, including diagonal, tridiagonal, moderately dense, and fully dense cases. Our results show that while HHL achieves near-ideal fidelity for highly structured matrices, performance degrades as sparsity decreases due to the increasing cost of Hamiltonian simulation and reduced post-selection probability due to higher condition number. Block encoding is found to provide improved fidelity for moderately dense matrices, whereas Trotterisation offers a qubit-efficient approach for sparse systems. These results highlight the importance of matrix structure in determining the practical efficiency of HHL and inform future implementations that combine algorithmic optimisation with hardware-aware design.