6 citations · 6 across the 7 of their papers we have counts for
5 papers · 1 filter
Perturbative photonic matrix-vector multiplication with reduced phase-shift range
S. A. Fldzhyan, S. S. Straupe, M. Yu. Saygin
Programmable photonic meshes provide a promising platform for analog matrix-vector multiplication, but their scalability is often limited by the large phase-shift ranges required i…
Explicit Quantum Search Algorithm for the Densest k-Subgraph Problem
Yu. A. Biriukov, R. D. Morozov, I. V. Dyakonov +1
This paper addresses the problem of finding the densest -vertex subgraph in an arbitrary graph. This problem is NP-hard and has important applications in social network analysis…
LLM-Guided Evolutionary Search for Algebraic T-Count Optimization
Daniil Fisher, Valentin Khrulkov, Mikhail Saygin +2
T-count minimization is an NP-hard problem that arises in fault-tolerant quantum compilation. In the parity-matrix representation, which captures the non-Clifford part of a quantum…
Single-photon-boosted type-I fusion gates
A. A. Melkozerov, S. S. Straupe, M. Yu. Saygin
Fusion measurements are a key primitive for linear-optical quantum computing and quantum networks. Type-I and type-II fusion gates are widely used to combine small entangled resour…
Native QR Factorization on Programmable Photonic Meshes
S. A. Fldzhyan, S. S. Straupe, M. Yu. Saygin
We propose a photonic native procedure for computing the QR factorization of a matrix using a programmable unitary interferometer mesh. The method configures the mesh through a seq…