Quick Navigation
Topics
Quantum Machine Learning
Learning fermionic linear optics with Heisenberg scaling and physical operations
arXiv
Authors: Aria Christensen, Andrew Zhao
Year
2026
Paper ID
2834
Status
Preprint
Abstract Read
~2 min
Abstract Words
201
Citations
N/A
Abstract
We revisit the problem of learning fermionic linear optics (FLO), also known as fermionic Gaussian unitaries. Given black-box query access to an unknown FLO, previous proposals required widetilde{mathcal{O}}\(n5 / varepsilon2\) queries, where n is the system size and varepsilon is the error in diamond distance. These algorithms also use unphysical operations (i.e., violating fermionic superselection rules) and/or n auxiliary modes to prepare Choi states of the FLO. In this work, we establish efficient and experimentally friendly protocols that obey superselection, use minimal ancilla (at most 1 extra mode), and exhibit improved dependence on both parameters n and varepsilon. For arbitrary (active) FLOs this algorithm makes at most widetilde{mathcal{O}}\(n4 / varepsilon\) queries, while for number-conserving (passive) FLOs we show that mathcal{O}\(n3 / varepsilon\) queries suffice. The complexity of the active case can be further reduced to widetilde{mathcal{O}}\(n3 / varepsilon\) at the cost of using n ancilla. This marks the first FLO learning algorithm that attains Heisenberg scaling in precision. As a side result, we also demonstrate an improved copy complexity of widetilde{mathcal{O}}\(n η2 / varepsilon2\) for time-efficient state tomography of η-particle Slater determinants in varepsilon trace distance, which may be of independent interest.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- We revisit the problem of learning fermionic linear optics (FLO), also known as fermionic Gaussian unitaries.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.