001     888651
005     20210130011052.0
024 7 _ |a 10.1088/1367-2630/ab84b3
|2 doi
024 7 _ |a 2128/26452
|2 Handle
024 7 _ |a WOS:000538446700001
|2 WOS
037 _ _ |a FZJ-2020-05094
082 _ _ |a 530
100 1 _ |a Amaro, David
|0 0000-0001-7853-9581
|b 0
245 _ _ |a Scalable characterization of localizable entanglement in noisy topological quantum codes
260 _ _ |a [London]
|c 2020
|b IOP
336 7 _ |a article
|2 DRIVER
336 7 _ |a Output Types/Journal article
|2 DataCite
336 7 _ |a Journal Article
|b journal
|m journal
|0 PUB:(DE-HGF)16
|s 1607523888_30926
|2 PUB:(DE-HGF)
336 7 _ |a ARTICLE
|2 BibTeX
336 7 _ |a JOURNAL_ARTICLE
|2 ORCID
336 7 _ |a Journal Article
|0 0
|2 EndNote
520 _ _ |a Topological quantum error correcting codes have emerged as leading candidates towards the goal of achieving large-scale fault-tolerant quantum computers. However, quantifying entanglement in these systems of large size in the presence of noise is a challenging task. In this paper, we provide two different prescriptions to characterize noisy stabilizer states, including the surface and the color codes, in terms of localizable entanglement over a subset of qubits. In one approach, we exploit appropriately constructed entanglement witness operators to estimate a witness-based lower bound of localizable entanglement, which is directly accessible in experiments. In the other recipe, we use graph states that are local unitary equivalent to the stabilizer state to determine a computable measurement-based lower bound of localizable entanglement. If used experimentally, this translates to a lower bound of localizable entanglement obtained from single-qubit measurements in specific bases to be performed on the qubits outside the subsystem of interest. Towards computing these lower bounds, we discuss in detail the methodology of obtaining a local unitary equivalent graph state from a stabilizer state, which includes a new and scalable geometric recipe as well as an algebraic method that applies to general stabilizer states of arbitrary size. Moreover, as a crucial step of the latter recipe, we develop a scalable graph-transformation algorithm that creates a link between two specific nodes in a graph using a sequence of local complementation operations. We develop open-source Python packages for these transformations, and illustrate the methodology by applying it to a noisy topological color code, and study how the witness and measurement-based lower bounds of localizable entanglement varies with the distance between the chosen qubits.
536 _ _ |a 144 - Controlling Collective States (POF3-144)
|0 G:(DE-HGF)POF3-144
|c POF3-144
|f POF III
|x 0
588 _ _ |a Dataset connected to CrossRef
700 1 _ |a Müller, Markus
|0 P:(DE-Juel1)179396
|b 1
700 1 _ |a Pal, Amit Kumar
|0 0000-0002-4101-2193
|b 2
|e Corresponding author
773 _ _ |a 10.1088/1367-2630/ab84b3
|g Vol. 22, no. 5, p. 053038 -
|0 PERI:(DE-600)1464444-7
|n 5
|p 053038 -
|t New journal of physics
|v 22
|y 2020
|x 1367-2630
856 4 _ |u https://juser.fz-juelich.de/record/888651/files/Amaro_2020_New_J._Phys._22_053038.pdf
|y OpenAccess
909 C O |o oai:juser.fz-juelich.de:888651
|p openaire
|p open_access
|p VDB
|p driver
|p dnbdelivery
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 1
|6 P:(DE-Juel1)179396
913 1 _ |a DE-HGF
|l Future Information Technology - Fundamentals, Novel Concepts and Energy Efficiency (FIT)
|1 G:(DE-HGF)POF3-140
|0 G:(DE-HGF)POF3-144
|2 G:(DE-HGF)POF3-100
|v Controlling Collective States
|x 0
|4 G:(DE-HGF)POF
|3 G:(DE-HGF)POF3
|b Energie
914 1 _ |y 2020
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0200
|2 StatID
|b SCOPUS
|d 2020-08-21
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0160
|2 StatID
|b Essential Science Indicators
|d 2020-08-21
915 _ _ |a Creative Commons Attribution CC BY 4.0
|0 LIC:(DE-HGF)CCBY4
|2 HGFVOC
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0600
|2 StatID
|b Ebsco Academic Search
|d 2020-08-21
915 _ _ |a JCR
|0 StatID:(DE-HGF)0100
|2 StatID
|b NEW J PHYS : 2018
|d 2020-08-21
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0501
|2 StatID
|b DOAJ Seal
|d 2020-08-21
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0500
|2 StatID
|b DOAJ
|d 2020-08-21
915 _ _ |a WoS
|0 StatID:(DE-HGF)0113
|2 StatID
|b Science Citation Index Expanded
|d 2020-08-21
915 _ _ |a Fees
|0 StatID:(DE-HGF)0700
|2 StatID
|d 2020-08-21
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0150
|2 StatID
|b Web of Science Core Collection
|d 2020-08-21
915 _ _ |a IF < 5
|0 StatID:(DE-HGF)9900
|2 StatID
|d 2020-08-21
915 _ _ |a OpenAccess
|0 StatID:(DE-HGF)0510
|2 StatID
915 _ _ |a Peer Review
|0 StatID:(DE-HGF)0030
|2 StatID
|b ASC
|d 2020-08-21
915 _ _ |a Article Processing Charges
|0 StatID:(DE-HGF)0561
|2 StatID
|d 2020-08-21
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)1150
|2 StatID
|b Current Contents - Physical, Chemical and Earth Sciences
|d 2020-08-21
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0300
|2 StatID
|b Medline
|d 2020-08-21
915 _ _ |a Nationallizenz
|0 StatID:(DE-HGF)0420
|2 StatID
|d 2020-08-21
|w ger
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0199
|2 StatID
|b Clarivate Analytics Master Journal List
|d 2020-08-21
920 _ _ |l yes
920 1 _ |0 I:(DE-Juel1)PGI-2-20110106
|k PGI-2
|l Theoretische Nanoelektronik
|x 0
980 _ _ |a journal
980 _ _ |a VDB
980 _ _ |a UNRESTRICTED
980 _ _ |a I:(DE-Juel1)PGI-2-20110106
980 1 _ |a FullTexts


LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21