Quantum and Circuits

Download original file

This is the original TeX manuscript source. Use the paper’s PDF for typeset equations.

Read the typeset paper

1 \begin{thebibliography}{999}
2 \bibitem{q:Ramanujan1918}
3 S. Ramanujan,
4 \emph{On certain trigonometrical sums and their applications in the theory of numbers},
5 Transactions of the Cambridge Philosophical Society \textbf{22}, no.~13 (1918), 259--276.
6 Original-paper scan index: \url{https://www.imsc.res.in/~rao/ramanujan/CamUnivCpapers/Cpaper21/page1.htm}.
7 
8 
9 \bibitem{q:Vaidyanathan2014FIR}
10 P. P. Vaidyanathan,
11 \emph{Ramanujan-sum expansions for finite duration (FIR) sequences},
12 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 4933--4937.
13 \url{https://doi.org/10.1109/ICASSP.2014.6854540}.
14 Author manuscript: \url{https://systems.caltech.edu/dsp/PPVSquare.pdf}.
15 
16 
17 \bibitem{q:Vaidyanathan2014I}
18 P. P. Vaidyanathan,
19 \emph{Ramanujan Sums in the Context of Signal Processing---Part I: Fundamentals},
20 IEEE Transactions on Signal Processing \textbf{62}(16) (2014), 4145--4157.
21 \url{https://doi.org/10.1109/TSP.2014.2331617}.
22 
23 
24 \bibitem{q:Vaidyanathan2014II}
25 P. P. Vaidyanathan,
26 \emph{Ramanujan Sums in the Context of Signal Processing---Part II: FIR Representations and Applications},
27 IEEE Transactions on Signal Processing \textbf{62}(16) (2014), 4158--4172.
28 \url{https://doi.org/10.1109/TSP.2014.2331624}.
29 
30 \bibitem{q:KomorebiStratified16}
31 Komorebi P.,
32 \emph{Stratified Universality for Resolved Representations},
33 v1.16.0, Block 16, internal manuscript, 2026.
34 Proposition 21.11 and Boundary 21.12, printed pp.~189--190.
35 Preserved source: \texttt{Komorebi\_Stratified\_Universality\_Foundations\_v1.16.0\_Block16.pdf}.
36 
37 
38 
39 
40 \bibitem{s:AaronsonGottesman2004}
41 S. Aaronson and D. Gottesman,
42 \emph{Improved Simulation of Stabilizer Circuits},
43 Physical Review A 70 (2004), 052328.
44 
45 
46 \bibitem{s:AaronsonAmbainis2018}
47 S. Aaronson and A. Ambainis,
48 \emph{Forrelation: A Problem that Optimally Separates Quantum from Classical Computing},
49 SIAM Journal on Computing 47 (2018), 982--1038.
50 
51 
52 \bibitem{s:BallSimoens2026}
53 S. Ball and R. Simoens,
54 \emph{Thirty-six quantum officers are entangled},
55 arXiv:2603.02334, 2026.
56 
57 
58 \bibitem{s:BernsteinVazirani1997}
59 E. Bernstein and U. Vazirani,
60 \emph{Quantum Complexity Theory},
61 SIAM Journal on Computing 26 (1997), 1411--1473.
62 
63 
64 \bibitem{s:JozsaMiyake2008}
65 R. Jozsa and A. Miyake,
66 \emph{Matchgates and Classical Simulation of Quantum Circuits},
67 Proceedings of the Royal Society A 464 (2008), 3089--3106.
68 
69 
70 \bibitem{s:MustoVicary2016}
71 B. Musto and J. Vicary,
72 \emph{Quantum Latin Squares and Unitary Error Bases},
73 Quantum Information and Computation 16 (2016), 1318--1332.
74 
75 
76 \bibitem{s:RatherEtAl2022}
77 S. A. Rather, A. Burchardt, W. Bruzda, G. Rajchel-Mieldzio\'c, A. Lakshminarayan, and K. \.{Z}yczkowski,
78 \emph{Thirty-six Entangled Officers of Euler: Quantum Solution to a Classically Impossible Problem},
79 Physical Review Letters 128 (2022), 080507.
80 
81 
82 \bibitem{s:SchurWeyl}
83 Standard Schur--Weyl duality and representation-theoretic decomposition results are used in their finite-dimensional form.
84 
85 
86 \bibitem{s:Shor1997}
87 P. W. Shor,
88 \emph{Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer},
89 SIAM Journal on Computing 26 (1997), 1484--1509.
90 
91 
92 \bibitem{s:Simon1997}
93 D. Simon,
94 \emph{On the Power of Quantum Computation},
95 SIAM Journal on Computing 26 (1997), 1474--1483.
96 
97 
98 \bibitem{s:Valiant2002}
99 L. G. Valiant,
100 \emph{Quantum Circuits that Can Be Simulated Classically in Polynomial Time},
101 SIAM Journal on Computing 31 (2002), 1229--1254.
102 
103 
104 \bibitem{s:TransferRecords}
105 K. P.,
106 \emph{Quantum Transfer Blocks and Quantum Polyphase Transfer Calculus},
107 project research records, 2026.
108 
109 
110 
111 
112 
113 \bibitem{g:AcuavivaEtAl2026}
114 A.~Acuaviva, A.~Acuaviva, and P.~Acuaviva,
115 \emph{CNOT-Distance is NP-complete under all-to-all connectivity},
116 arXiv:2608.03825, 2026.
117 
118 
119 \bibitem{g:AmyMosca2019}
120 M.~Amy and M.~Mosca,
121 \emph{$T$-count optimization and Reed--Muller codes},
122 IEEE Trans. Inform. Theory \textbf{65} (2019), 4771--4784.
123 
124 
125 \bibitem{g:AmyEtAl2013}
126 M.~Amy, D.~Maslov, M.~Mosca, and M.~Roetteler,
127 \emph{A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits},
128 IEEE Trans. Comput.-Aided Design Integr. Circuits Syst. \textbf{32} (2013), 818--830.
129 
130 
131 \bibitem{g:Bataille2022}
132 M.~Bataille,
133 \emph{Quantum circuits of CNOT gates: optimization and entanglement},
134 Quantum Inf. Process. \textbf{21} (2022), Article 269.
135 
136 
137 \bibitem{g:BravyiKitaev2005}
138 S.~Bravyi and A.~Kitaev,
139 \emph{Universal quantum computation with ideal Clifford gates and noisy ancillas},
140 Phys. Rev. A \textbf{71} (2005), 022316.
141 
142 
143 \bibitem{g:BuFanJoo2025}
144 A.~Bu, E.~Fan, and R.~Joo,
145 \emph{Minimum synthesis cost of CNOT circuits},
146 Quantum Inf. Process. \textbf{24} (2025), Article 208.
147 
148 
149 \bibitem{g:Carter1972}
150 R.~W. Carter,
151 \emph{Simple Groups of Lie Type},
152 Wiley, 1972.
153 
154 
155 \bibitem{g:ChristensenEtAl2025}
156 J.~E. Christensen, S.~F. J\o rgensen, A.~Pavlogiannis, and J.~van de Pol,
157 \emph{On exact sizes of minimal CNOT circuits},
158 in \emph{Reversible Computation 2025}, Lecture Notes in Comput. Sci. \textbf{15716}, Springer, 2025, pp.~71--88.
159 
160 
161 \bibitem{g:DehaeneDeMoor2003}
162 J.~Dehaene and B.~De Moor,
163 \emph{Clifford group, stabilizer states, and linear and quadratic operations over $\mathrm{GF}(2)$},
164 Phys. Rev. A \textbf{68} (2003), 042318.
165 
166 
167 \bibitem{g:GongYu2026}
168 S.~Gong and A.~Yu,
169 \emph{Explicit matrices over $\mathbb Z_2$ with CNOT and row complexity $4n-o(n)$ and local logic gates},
170 arXiv:2607.28598, 2026.
171 
172 
173 \bibitem{g:Gottesman1997}
174 D.~Gottesman,
175 \emph{Stabilizer Codes and Quantum Error Correction},
176 Ph.D. thesis, California Institute of Technology, 1997.
177 
178 
179 \bibitem{g:GoubaultEtAl2021}
180 T.~Goubault de Brugi\`ere, M.~Baboulin, B.~Valiron, S.~Martiel, and C.~Allouche,
181 \emph{Gaussian elimination versus greedy methods for the synthesis of linear reversible circuits},
182 ACM Trans. Quantum Comput. \textbf{2} (2021), Article 11.
183 
184 
185 \bibitem{g:Hartshorne1977}
186 R.~Hartshorne,
187 \emph{Algebraic Geometry},
188 Graduate Texts in Mathematics, vol.~52, Springer, 1977.
189 
190 
191 \bibitem{g:Humphreys1975}
192 J.~E. Humphreys,
193 \emph{Linear Algebraic Groups},
194 Graduate Texts in Mathematics, vol.~21, Springer, 1975.
195 
196 
197 \bibitem{g:JiangEtAl2020}
198 J.~Jiang, X.~Sun, S.-H. Teng, B.~Wu, K.~Wu, and J.~Zhang,
199 \emph{Optimal space-depth trade-off of CNOT circuits in quantum logic synthesis},
200 in \emph{Proceedings of SODA 2020}, SIAM, 2020, pp.~213--229.
201 
202 
203 \bibitem{g:Jorgensen2026}
204 S.~F. J\o rgensen,
205 \emph{Lower bounds for the CNOT-complexity of linear reversible operators},
206 arXiv:2607.22248, 2026.
207 
208 
209 \bibitem{g:KliuchnikovEtAl2013}
210 V.~Kliuchnikov, D.~Maslov, and M.~Mosca,
211 \emph{Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and $T$ gates},
212 Quantum Inf. Comput. \textbf{13} (2013), 607--630.
213 
214 
215 \bibitem{g:Landsberg2012}
216 J.~M. Landsberg,
217 \emph{Tensors: Geometry and Applications},
218 Graduate Studies in Mathematics, vol.~128, American Mathematical Society, 2012.
219 
220 
221 \bibitem{g:NielsenChuang2010}
222 M.~A. Nielsen and I.~L. Chuang,
223 \emph{Quantum Computation and Quantum Information}, 10th anniversary ed.,
224 Cambridge University Press, 2010.
225 
226 
227 \bibitem{g:Oxley2011}
228 J.~Oxley,
229 \emph{Matroid Theory}, 2nd ed.,
230 Oxford Graduate Texts in Mathematics, vol.~21, Oxford University Press, 2011.
231 
232 
233 \bibitem{g:PatelMarkovHayes2008}
234 K.~N. Patel, I.~L. Markov, and J.~P. Hayes,
235 \emph{Optimal synthesis of linear reversible circuits},
236 Quantum Inf. Comput. \textbf{8} (2008), 282--294.
237 
238 
239 \bibitem{g:RatherEtAl2023}
240 S.~A. Rather, N.~Ramadas, V.~Kodiyalam, and A.~Lakshminarayan,
241 \emph{Absolutely maximally entangled state equivalence and the construction of infinite quantum solutions to the problem of 36 officers of Euler},
242 Phys. Rev. A \textbf{108} (2023), 032412.
243 
244 
245 \bibitem{g:SaeediMarkov2013}
246 M.~Saeedi and I.~L. Markov,
247 \emph{Synthesis and optimization of reversible circuits---a survey},
248 ACM Comput. Surv. \textbf{45} (2013), Article 21.
249 
250 
251 \bibitem{g:Selinger2013}
252 P.~Selinger,
253 \emph{Quantum circuits of $T$-depth one},
254 Phys. Rev. A \textbf{87} (2013), 042302.
255 
256 
257 \bibitem{g:Serre1977}
258 J.-P. Serre,
259 \emph{Linear Representations of Finite Groups},
260 Graduate Texts in Mathematics, vol.~42, Springer, 1977.
261 
262 
263 \bibitem{g:ShaikVanDePol2025}
264 I.~Shaik and J.~van de Pol,
265 \emph{CNOT-optimal Clifford synthesis as SAT},
266 in \emph{28th International Conference on Theory and Applications of Satisfiability Testing},
267 LIPIcs \textbf{341} (2025), Article 28.
268 
269 
270 \bibitem{g:WebsterEtAl2025}
271 M.~Webster, S.~Koutsioumpas, and D.~E. Browne,
272 \emph{Heuristic and optimal synthesis of CNOT and Clifford circuits},
273 arXiv:2503.14660, 2025.
274 
275 
276 \bibitem{g:WeedbrookEtAl2012}
277 C.~Weedbrook, S.~Pirandola, R.~Garc\'ia-Patr\'on, N.~J. Cerf, T.~C. Ralph, J.~H. Shapiro, and S.~Lloyd,
278 \emph{Gaussian quantum information},
279 Rev. Mod. Phys. \textbf{84} (2012), 621--669.
280 
281 
282 
283 \addcontentsline{toc}{chapter}{Sources and background references}
284 
285 \bibitem{c:foundations} Komorebi P. \emph{Foundations: restored computation and complete discrepancies}. \pathref{docs/FOUNDATIONS.md}, source release v1.2.0, September 21, 2026. Supplied repository source.
286 
287 \bibitem{c:theory} Komorebi P. \emph{Complete discrepancy covers, grade extraction, and exact gluing}. \pathref{docs/THEORY.md}, source release v1.2.0, September 21, 2026. Supplied repository manuscript.
288 
289 \bibitem{c:claims} Komorebi P. \emph{Claim register}. \pathref{docs/CLAIMS.md} and \pathref{docs/claims.json}, source release v1.2.0. Authoritative active groups C01--C08.
290 
291 \bibitem{c:boundary} Komorebi P. \emph{Proof and computation boundary}. \pathref{PROOF_BOUNDARY.md}, source release v1.2.0. Controlling model and evidence qualifications.
292 
293 \bibitem{c:audit} Komorebi P. \emph{Release audit: 1.2.0}. \pathref{evidence/lean-block02/RELEASE_AUDIT.md}, September 21, 2026. Scoped archived formal verification. This edition also supplies fresh computational and document validation records.
294 
295 \bibitem{c:reproduction} Komorebi P. \emph{Reproduction contract}. \pathref{docs/REPRODUCIBILITY.md}, source release v1.2.0. Frozen finite results: \pathref{evidence/baseline/completeness.json}, \pathref{projection.json}, and \pathref{fingerprint.json} in the same baseline directory.
296 
297 \bibitem{c:soeken} Mathias Soeken. \emph{Determining the Multiplicative Complexity of Boolean Functions using SAT}. arXiv:2005.01778v1, 2020. Background XOR--AND model and degree-bound context.\par\url{https://arxiv.org/abs/2005.01778v1}
298 
299 \bibitem{c:findboyar} Joan Boyar and Magnus Gausdal Find. \emph{Multiplicative Complexity of Vector Valued Boolean Functions}. arXiv:1407.6169v3, 2018 revision of the 2014 preprint. Background affine-restriction and quadratic-complexity context.\par\url{https://arxiv.org/abs/1407.6169v3}
300 
301 \bibitem{c:beckli} Chris Beck and Yuan Li. \emph{Represent MOD function by low degree polynomial with unbounded one-sided error}. arXiv:1304.0713v1, 2013. Background one-sided polynomial-immunity terminology.\par\url{https://arxiv.org/abs/1304.0713v1}
302 
303 \end{thebibliography}

Back to source controls

Back to Quantum and Circuits