<?xml-model href='http://www.tei-c.org/release/xml/tei/custom/schema/relaxng/tei_all.rng' schematypens='http://relaxng.org/ns/structure/1.0'?><TEI xmlns="http://www.tei-c.org/ns/1.0">
	<teiHeader>
		<fileDesc>
			<titleStmt><title level='a'>Error Correction of Transversal cnot Gates for Scalable Surface-Code Computation</title></titleStmt>
			<publicationStmt>
				<publisher>PRX Quantum</publisher>
				<date>05/01/2025</date>
			</publicationStmt>
			<sourceDesc>
				<bibl> 
					<idno type="par_id">10592927</idno>
					<idno type="doi">10.1103/PRXQuantum.6.020326</idno>
					<title level='j'>PRX quantum</title>
<idno>2691-3399</idno>
<biblScope unit="volume">6</biblScope>
<biblScope unit="issue">2</biblScope>					

					<author>Kaavya Sahay</author><author>Yingjia Lin</author><author>Shilin Huang</author><author>Kenneth R Brown</author><author>Shruti Puri</author>
				</bibl>
			</sourceDesc>
		</fileDesc>
		<profileDesc>
			<abstract><ab><![CDATA[<p>Recent experimental advances have made it possible to implement logical multiqubit transversal gates on surface codes in a multitude of platforms. A transversal controlled- (t) gate on two surface codes introduces correlated errors across the code blocks and thus requires modified decoding compared to established methods of decoding surface-code quantum memory (SCQM) or lattice-surgery operations. In this work, we examine and benchmark the performance of three different decoding strategies for the t for scalable fault-tolerant quantum computation. In particular, we present a low-complexity decoder based on minimum-weight perfect matching (MWPM) that achieves the same threshold as the SCQM MWPM decoder. We extend our analysis with a study of tailored decoding of a transversal-teleportation circuit, along with a comparison between the performance of lattice-surgery and transversal operations under Pauli- and erasure-noise models. Our investigation builds toward systematic estimation of the cost of implementing large-scale quantum algorithms based on transversal gates in the surface code.</p> <sec><supplementary-material><permissions><copyright-statement>Published by the American Physical Society</copyright-statement><copyright-year>2025</copyright-year></permissions></supplementary-material></sec>]]></ab></abstract>
		</profileDesc>
	</teiHeader>
	<text><body xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>We e x e m plif y o ur ar g u m e nts usi n g a " bi n ar y-tr e e " circ uit of l o gi c al g a d g et d e pt h M i n v ol vi n g 2 M q u bits. A n e x a m pl e cir c uit w h er e M = 3 is s h o w n i n Fi g. 3( a) . I n t his cir c uit, a si n gl e bit-fli p err or X q o n a q u bit q i n t h e c o ntr ol      </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>n c e i n t h e c h os e n fr a m e, w e br e a k u p G X i nt o s u b gr a p hs G C X a n d G T X , w h er e G C X (G T X ) c o nt ai ns t h e fr a m e-d e fi n e d n o d es r el at e d t o t h e c h e c ks of C (T ). We t er m G C X a d e p e nd e nt s u b gr a p h si n c e its c h e c ks c h a n g e d u e t o t h e t C N O T i n t h e d y n a mi</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>b y t h e H U F al g orit h m i n c o m bi n ati o n wit h t h e i n cr e as e d c o m pl e xit y of h y p er e d g es i n t h e d e c o di n g gr a p h f or t h e tC N O T v ers us t h e 2 S C Q M. H y p er gr a p h d e c o di n g pr es e nts a p ot e nti al p at h t o d e c o d e a n d c orr e ct l o gi c al o p er ati o ns t h at i n d u c e h y p er e d g es. H o w e v er, as s e e n a b o v e, ti m e-e ffi ci e nt h y p er gr a p h str at egi es u n d er p erf or m wit h i n cr e as e d h y p er gr a p h c o m pl e xit y a n d h a v e hi g h er r u n-ti m e o v er h e a ds t h a n t h eir gr a p h-b as e d c o u nt er p arts. I d e all y, w e w o ul d li k e a n e ffi ci e nt d e c o di n g al g orit h m f or t h e tC N O T t h at s c al es e q u al t o or b ett er t h a n t h e e q ui v al e nt d e c o d er a p pli e d t o a 2 S C Q M, w hil e at t h e s a m e ti m e pr es er vi n g t h e S C Q M t hr es</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>usi n g G T X i n t h e st ati c fr a m e. Fr o m t h e r es ulti n g s ol uti o n, t h e d e c o d er i d e nti fi es err or cl ust ers o n T t h at o c c ur b ef or e t h e tC N O T . D et e ct ors i n G C X i n t h e st ati c fr a m e t h at c orr es p o n d t o t h e pr o p a g ati o n of t h es e i d e nti</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>V. L O GI C A L-S T A T E T E L E P O R T A TI O N</head><p>O n e of t h e pri m ar y us es of t w o-q u bit g at es i n q u a nt u m al g orit h ms will b e f or l o gi c al-st at e t el e p ort ati o n, p arti c ul arl y f or n o n-Cli ff or d g at es, s u c h as i n Fi g.  </p><p>We ill ustr at e t h e b e h a vi or of t h e d e c o d er usi n g a n i nst a n c e of a d at a-q u bit err or Z T ,q o n a q u bit q i n T t h at cr e at es d ef e cts o n T at r o u n d k :</p><p>(       </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>2d }. N ot e t h at f or C , t h es e d et e ct ors ar e di ff er e nt fr o m t h os e d e fi n e d b y c h e c k e v ol uti o n i n t h e d y n a mi c fr a m e a n d ar e i nst e a d i n t h e st ati c fr a m e.</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Wit h t his s et of d et e ct ors i n t h e h y bri d fr a m e, it is p ossi bl e t o e xtr a ct i n d e p e n d e nt err or m e c h a nis ms t h at</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>We e x p a n d o n d e c o di n g a n d c orr e cti o n of err ors d uri n g t h e X X J P m e as ur e m e nt dis c uss e d i n A p p e n di x E . Cl os e o bs er v ati o n of t h e "l e gs " of t h e H s h a p e i n Fi g. 1 0( b) -r e pr es e nti n g pr e-J P st a bili z er m e as ur e m e nt r o u n ds o n t h e i n di vi d u al s urf a c e c o d es, h er e o n r ef err e d t o as b u ff er r o u n ds -s h o ws t h at t h e y ar e e q ui v al e nt t o t h e s p a c eti m e v ol u m e of i n di vi d u al S C Q M e x p eri m e nts ( u p t o ti m e b o u n d ari es t h at c o n n e ct t h e m t o t h e J P r o u n ds). T h e bri d gi n g r e gi o n i n t h e</head></div><note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_0"><p>6 9 1-3</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_1"><p>9 9/ 2 5/ 6( 2)/ 0 2 0 3 2 6( 1 8)</p></note>
		</body>
		</text>
</TEI>
