Quantum Algorithms and Oracles with the Scalable ZX-calculus

Uložené v:
Podrobná bibliografia
Vydané v:Electronic proceedings in theoretical computer science Ročník 343; s. 193 - 209
Hlavní autori: Carette, Titouan, D'Anello, Yohann, Perdrix, Simon
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: 18.09.2021
ISSN:2075-2180, 2075-2180
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Author D'Anello, Yohann
Carette, Titouan
Perdrix, Simon
Author_xml – sequence: 1
  givenname: Titouan
  surname: Carette
  fullname: Carette, Titouan
  organization: Université de Lorraine, CNRS, Inria, LORIA
– sequence: 2
  givenname: Yohann
  surname: D'Anello
  fullname: D'Anello, Yohann
  organization: Université de Lorraine, CNRS, Inria, LORIA
– sequence: 3
  givenname: Simon
  surname: Perdrix
  fullname: Perdrix, Simon
  organization: Université de Lorraine, CNRS, Inria, LORIA
BookMark eNpNj8FKw0AURQepYK3d-QHzASbOm3lpGnBTQq1CoUoriJvwMjOxlUkiMwni3xu1i97NvZzFhXPJRk3bWMauQcQoBd4un3b5NlaoYhBnbCxFmkQS5mJ0si_YNIQPMURlErPZmN0999R0fc0X7r31h25fB06N4RtP2tnAvwbEu73lW02OSmf522s0TN27Plyx84pcsNNjT9jL_XKXP0TrzeoxX6wjDZnsIi1QopYpJQYUZSVaSFIDhIKSmUUiIyUREqIpyYpSygqgmptEAOkMUjVhN_-_2rcheFsVn_5Qk_8uQBS_8sWffDHID0T9APfOTf4
Cites_doi 10.1145/3209108.3209128
10.1007/978-3-540-70583-3_25], year = 2011
10.1145/3209108.3209139
10.1137/S0097539796298637
10.4204/EPTCS.318.6
10.22331/q-2020-01-09-218
10.4230/LIPIcs.TQC.2020.11
10.22331/q-2020-06-04-279
10.1145/3209108.3209131
10.4204/EPTCS.287.2
10.1103/PhysRevX.10.041030
10.1145/167088.167097
10.1109/LICS.2013.14
10.1103/PhysRevLett.79.325
10.1007/978-3-030-02508-3_7
10.4230/LIPIcs.MFCS.2019.55
10.4230/LIPIcs.ICALP.2019.108
10.1017/9781316219317
10.4204/EPTCS.172.19
10.22331/q-2019-04-30-135
10.1098/rspa.1992.0167
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.4204/EPTCS.343.10
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2075-2180
EndPage 209
ExternalDocumentID 10_4204_EPTCS_343_10
GroupedDBID 5VS
AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
E3Z
GROUPED_DOAJ
KQ8
M~E
OK1
ID FETCH-LOGICAL-c192t-c0424c27a5d13a9b4e157d1a40a56e4aad22aa4a44dbae0b22f11f8d501ac9173
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001041743100010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2075-2180
IngestDate Sat Nov 29 02:05:32 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c192t-c0424c27a5d13a9b4e157d1a40a56e4aad22aa4a44dbae0b22f11f8d501ac9173
PageCount 17
ParticipantIDs crossref_primary_10_4204_EPTCS_343_10
PublicationCentury 2000
PublicationDate 2021-09-18
PublicationDateYYYYMMDD 2021-09-18
PublicationDate_xml – month: 09
  year: 2021
  text: 2021-09-18
  day: 18
PublicationDecade 2020
PublicationTitle Electronic proceedings in theoretical computer science
PublicationYear 2021
References Carette (carette2019szx) 2019
Hadzihasanovic (hadzihasanovic2018zw) 2018
de Beaudrap (de2020well) 2020
Chantawibul (chantawibul2018monoidal) 2018
Kissinger (kissinger2019reducing) 2019
Carette (carette2019completeness) 2019
de Beaudrap (Pauli-Fusion) 2020; 318
Jeandel (jeandel2018diagrammatic) 2018
de Beaudrap (de2017zx) 2017
Deutsch (deutsch1992rapid) 1992; 439
Carette (carette2020colored) 2020
Hanks (hanks2020effective) 2020; 10
Gidney (gidney2018efficient) 2018
Coecke (picturing-qp) 2017
Zeng (zeng2014abstract) 2014
Backens (backens2018zh) 2019; 287
de Beaudrap (de2020fast) 2020
Simon (simon1997power) 1997; 26
Grover (Gro97b) 1997; 79
Gogioso (gogioso2017fully) 2017
Vicary (vicary2013topological) 2013
Chancellor (chancellor2016graphical) 2016
Jeandel (jeandel2018complete) 2018
Hadzihasanovic (HNW) 2018
Bernstein (bernstein1997quantum) 1997; 26
Coecke (coecke2011interacting); 13
Duncan (duncan2019graph) 2019
References_xml – start-page: 502
  volume-title: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
  year: 2018
  ident: HNW
  article-title: Two Complete Axiomatisations of Pure-state Qubit Quantum Computing
  doi: 10.1145/3209108.3209128
– volume: 13
  issue: 4
  ident: coecke2011interacting
  article-title: Interacting quantum observables: categorical algebra and diagrammatics
  publication-title: New Journal of Physics
  doi: 10.1007/978-3-540-70583-3_25], year = 2011
– start-page: 569
  volume-title: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  year: 2018
  ident: jeandel2018diagrammatic
  article-title: Diagrammatic reasoning beyond Clifford+ T quantum mechanics
  doi: 10.1145/3209108.3209139
– volume: 26
  start-page: 1474
  issue: 5
  year: 1997
  ident: simon1997power
  article-title: On the power of quantum computation
  publication-title: SIAM journal on computing
  doi: 10.1137/S0097539796298637
– volume: 318
  start-page: 85
  volume-title: Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019
  year: 2020
  ident: Pauli-Fusion
  article-title: Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
  doi: 10.4204/EPTCS.318.6
– year: 2018
  ident: hadzihasanovic2018zw
  article-title: ZW calculi: diagrammatic languages for pure-state quantum computing
  publication-title: Logic and Applications LAP 2018
– year: 2017
  ident: de2017zx
  article-title: The ZX calculus is a language for surface code lattice surgery
  publication-title: https://quantum-journal.org/papers/q-2020-01-09-218/
  doi: 10.22331/q-2020-01-09-218
– volume-title: 15th Conference on the Theory of Quantum Computation, Communication and Cryptography
  year: 2020
  ident: de2020fast
  article-title: Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities
  doi: 10.4230/LIPIcs.TQC.2020.11
– year: 2019
  ident: duncan2019graph
  article-title: Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
  publication-title: arXiv preprint arXiv:1902.03178
  doi: 10.22331/q-2020-06-04-279
– start-page: 559
  volume-title: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  year: 2018
  ident: jeandel2018complete
  article-title: A complete axiomatisation of the ZX-calculus for Clifford+T quantum mechanics
  doi: 10.1145/3209108.3209131
– volume: 287
  start-page: 23
  volume-title: Proceedings of the 15th International Conference on Quantum Physics and Logic, Halifax, Canada, 3-7th June 2018
  year: 2019
  ident: backens2018zh
  article-title: ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
  doi: 10.4204/EPTCS.287.2
– volume: 10
  issue: 4
  year: 2020
  ident: hanks2020effective
  article-title: Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
  publication-title: Physical Review X
  doi: 10.1103/PhysRevX.10.041030
– year: 2020
  ident: carette2020colored
  article-title: Colored props for large scale graphical reasoning
  publication-title: arXiv preprint arXiv:2007.03564
– volume: 26
  start-page: 1411
  issue: 5
  year: 1997
  ident: bernstein1997quantum
  article-title: Quantum complexity theory
  publication-title: SIAM Journal on computing
  doi: 10.1145/167088.167097
– year: 2019
  ident: kissinger2019reducing
  article-title: Reducing T-count with the ZX-calculus
  publication-title: arXiv preprint arXiv:1903.10477
– start-page: 93
  volume-title: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
  year: 2013
  ident: vicary2013topological
  article-title: Topological structure of quantum algorithms
  doi: 10.1109/LICS.2013.14
– volume: 79
  year: 1997
  ident: Gro97b
  article-title: Quantum Mechanics Helps in Searching for a Needle in a Haystack
  publication-title: Phys. Rev. Lett.
  doi: 10.1103/PhysRevLett.79.325
– start-page: 116
  volume-title: International Colloquium on Theoretical Aspects of Computing
  year: 2018
  ident: chantawibul2018monoidal
  article-title: Monoidal Multiplexing
  doi: 10.1007/978-3-030-02508-3_7
– volume-title: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
  year: 2019
  ident: carette2019szx
  article-title: SZX-Calculus: Scalable Graphical Quantum Reasoning
  doi: 10.4230/LIPIcs.MFCS.2019.55
– volume-title: International Colloquium on Automata, Languages, and Programming (ICALP'19)
  year: 2019
  ident: carette2019completeness
  article-title: Completeness of Graphical Languages for Mixed States Quantum Mechanics
  doi: 10.4230/LIPIcs.ICALP.2019.108
– volume-title: Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning
  year: 2017
  ident: picturing-qp
  doi: 10.1017/9781316219317
– year: 2014
  ident: zeng2014abstract
  article-title: Abstract structure of unitary oracles for quantum algorithms
  publication-title: arXiv preprint arXiv:1406.1278
  doi: 10.4204/EPTCS.172.19
– year: 2020
  ident: de2020well
  article-title: Well-tempered ZX and ZH calculi
  publication-title: arXiv preprint arXiv:2006.02557
– year: 2017
  ident: gogioso2017fully
  article-title: Fully graphical treatment of the quantum algorithm for the Hidden Subgroup Problem
  publication-title: arXiv preprint arXiv:1701.08669
– year: 2018
  ident: gidney2018efficient
  article-title: Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
  publication-title: arXiv preprint arXiv:1812.01238
  doi: 10.22331/q-2019-04-30-135
– year: 2016
  ident: chancellor2016graphical
  article-title: Graphical structures for design and verification of quantum error correction
  publication-title: arXiv preprint arXiv:1611.08012
– volume: 439
  start-page: 553
  issue: 1907
  year: 1992
  ident: deutsch1992rapid
  article-title: Rapid solution of problems by quantum computation
  publication-title: Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
  doi: 10.1098/rspa.1992.0167
SSID ssj0000392496
Score 2.2727766
SourceID crossref
SourceType Index Database
StartPage 193
Title Quantum Algorithms and Oracles with the Scalable ZX-calculus
Volume 343
WOSCitedRecordID wos001041743100010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2075-2180
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000392496
  issn: 2075-2180
  databaseCode: M~E
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3LT9swGLcq4LALgz0EDJAP4zSFxY4T1xIXxEO78BJF6naJvtourdSmKG0R0qT97XxOnCYMDnDgEkVW7ET-fvle_h6EfLdKCWtFGIg-04FIDARKuEKuwvSZUvhHJVA0m5Dn5-1uV122Wn-rXJj7kcyy9sODuntXUuMYEtulzr6B3ItFcQDvkeh4RbLj9VWEv5rjZjm3--h2gpb_YFxWYb7IwQXAecfrwNXfhFGRN_WnG-CtcwNOn_jp6wY5tZSb-rjIRfKj9l0hfnhRWp9puAjgsqQvMo15DcLjPS4Ps-rM5_dkAFlWM-jc5MNCHl4Pxx4x3ifBmQugaLJRjopIgMpDeeJiXxjzvDcSUYN7srJZohfEvKib8IzHCx4KpMHJZefoeh_n7_uw2CeltP8TcYvAQzR53Py0mJ3i7NSl5y1zGSsXD3j2r3bQhZEzTYvmhNWXl4kTboGfzdc3VJqGbtJZI6veqKCHJRjWSctmn8jHqmEH9fz7Mznw2KA1Nihig3psUIcNitSlFTZoAxtfyM3pSefoV-DbZwQa1fZZoN2ptuYSYsMiUD1hWSwNAxFCnFgBYDgHECCE6YENe5z3Geu3TRwy0GjFR1_JUjbJ7Aahxsoe1wkobbkAaQB_YxNrictJSCK9SfaqHUjvyiop6UtbvfXK576RDzWstsnSLJ_bHbKi72fDab5b0OkRbZJeYQ
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Quantum+Algorithms+and+Oracles+with+the+Scalable+ZX-calculus&rft.jtitle=Electronic+proceedings+in+theoretical+computer+science&rft.au=Carette%2C+Titouan&rft.au=D%27Anello%2C+Yohann&rft.au=Perdrix%2C+Simon&rft.date=2021-09-18&rft.issn=2075-2180&rft.eissn=2075-2180&rft.volume=343&rft.spage=193&rft.epage=209&rft_id=info:doi/10.4204%2FEPTCS.343.10&rft.externalDBID=n%2Fa&rft.externalDocID=10_4204_EPTCS_343_10
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2075-2180&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2075-2180&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2075-2180&client=summon