%PDF-1.4
%
1 0 obj
<>stream
application/pdfIEEEIEEE Access;2023;11; ;10.1109/ACCESS.2023.3237997Shortest Path Finding in Quantum Networks With Quasi-Linear ComplexityQuantum networksquantum repeaterspath-finding algorithmend-to-end fidelitymulti-objective routingSara SantosFrancisco A. MonteiroBruno C. CoutinhoYasser Omar
IEEE Access7180 202310.1109/ACCESS.2023.3237997117194
VoR
endstream
endobj
2 0 obj
<>
endobj
3 0 obj
<>/ProcSet[/PDF/Text]/Font<>/XObject<>>>/Annots[15 0 R 16 0 R 17 0 R 18 0 R 19 0 R 20 0 R 21 0 R 22 0 R 23 0 R 24 0 R 25 0 R 26 0 R 27 0 R 28 0 R 29 0 R 30 0 R 31 0 R 32 0 R 33 0 R 34 0 R 35 0 R 36 0 R 37 0 R 38 0 R 39 0 R 40 0 R 41 0 R 42 0 R 43 0 R 44 0 R 45 0 R 46 0 R 47 0 R 48 0 R 49 0 R 50 0 R 51 0 R]/CropBox[0 0 576 782.929]/Parent 52 0 R/Rotate 0/MediaBox[0 0 576 782.929]>>
endobj
4 0 obj
<>stream
HWms6+HDNqrsm^ǚsCYņ"V)Dir7},}y$z>M"E:PiINh4G̰"+۪m?+ȋꢪ[ly^G^k8kďNjY3/媰ɏѫI!Q? E K{կ$:_b'n6H&PH"g b8(1$5t]E5b2ECe7mZF$'S"FΌ/:A6Fr(h,ӭL49I3јa$,Qz>>u)׃z!.FϒoJ0HZ'0$P8Xwjz?>I 8Ip*Մi
4'ܟT2)}@{T' 4(R
rhXK BZs
I(NLaT!Nd
XJ8RHP` A6126Q" \<d*^N1~R.K,DRޜ.i:N't8ի^&hό܅1&RT/[c2T*ǻZ}P>S30G4 8ak4M6n-P&iFЩ95#!#V37D%'$nN!s#~-F$S4?zeH3šI%I%8{|FS>C9J d'A/
#G::k. {jcX"Hj ./usPeGKii̘ %!on4jl}]˼o <-
-m֬keUD{;I\LJ,ogLu__B >'$[il4s> \hm.5on43oژ;6COtH
Inp]E5b2PԺy~햮m]6km㫬jfyi8{hj"o!L&r$!X&jԏI8 IAw.A>Pm=ikM9LX%r{PBWrN r{UCC=˄z5ha氖ZRӐh1d#sD={%+Qƌ1- Af0?d}b>Yy,3ˣ}u,FϠurZi%@+"MH>U4%LCXE* V'ay'UxHV׳ӧ_G ;NOwZ#fr<}cx$#y/{|yD C$N$_HWoKN#t2POQ4Tw0yt3f~ئ.lm06iϸk
he
TOuDc;'-ҹC'RzQvD⫕wY~h!%qk=M Rp]|Ɩpcmz]XiuVFʮ,V"`@$2*@M4>l'A;(\NPȕڅӔs |@83/I&ۺ8[XL 3[`ݤ;OQ
KwlKhAs[]țh;^bA)7Çn{\O{sxphѮl@^U w5 ps@iWi7 !5k}u͚u'\9ɼt`I