U
UtherSRG
Guest
Added {{Orphan}} and {{Improve categories}} tags
[td]{{Short description|Method of quantum computing via entanglement}}[/td] [td][/td]
[td][/td] [td]{{Orphan|date=September 2025}}[/td] [td]A '''non-local quantum computation''' (or NLQC) is a distributed method of performing a [[quantum computation]]; the method involves shared [[quantum entanglement| entanglement]] and a single, simultaneous round of communication. NLQC was initially studied as a cheating strategy in the context of [[Quantum cryptography#Position-based quantum cryptography| quantum position verification]], and has since been related to a number of other subjects including [[Quantum complexity theory|computational complexity]].,<ref name=Tgatebounds>{{cite conference |last=Speelman |first=Florian |title=Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits |series=Leibniz International Proceedings in Informatics (LIPIcs) |volume=61 |pages=9:1β9:24 |publisher=Schloss Dagstuhl β Leibniz-Zentrum fΓΌr Informatik |year=2016 |doi=10.4230/LIPIcs.TQC.2016.9 |doi-access=free}}</ref><ref name=gardenhose>{{cite conference | last1 = Buhrman | first1 = Harry | last2 = Fehr | first2 = Serge | last3 = Schaffner | first3 = Christian | last4 = Speelman | first4 = Florian | title = The garden-hose model | pages = 145β158 | year = 2013 | publisher = ACM | doi = 10.1145/2422436.2422453 | url = https://doi.org/10.1145/2422436.2422453}}</ref> aspects of classical [[Information-theoretic security|information-theoretic cryptography]],<ref name=ITC>{{cite journal | author1 = Allerstorfer, Rene | author2 = Buhrman, Harry[/td]
[td]A '''non-local quantum computation''' (or NLQC) is a distributed method of performing a [[quantum computation]]; the method involves shared [[quantum entanglement| entanglement]] and a single, simultaneous round of communication. NLQC was initially studied as a cheating strategy in the context of [[Quantum cryptography#Position-based quantum cryptography| quantum position verification]], and has since been related to a number of other subjects including [[Quantum complexity theory|computational complexity]].,<ref name=Tgatebounds>{{cite conference |last=Speelman |first=Florian |title=Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits |series=Leibniz International Proceedings in Informatics (LIPIcs) |volume=61 |pages=9:1β9:24 |publisher=Schloss Dagstuhl β Leibniz-Zentrum fΓΌr Informatik |year=2016 |doi=10.4230/LIPIcs.TQC.2016.9 |doi-access=free}}</ref><ref name=gardenhose>{{cite conference | last1 = Buhrman | first1 = Harry | last2 = Fehr | first2 = Serge | last3 = Schaffner | first3 = Christian | last4 = Speelman | first4 = Florian | title = The garden-hose model | pages = 145β158 | year = 2013 | publisher = ACM | doi = 10.1145/2422436.2422453 | url = https://doi.org/10.1145/2422436.2422453}}</ref> aspects of classical [[Information-theoretic security|information-theoretic cryptography]],<ref name=ITC>{{cite journal | author1 = Allerstorfer, Rene | author2 = Buhrman, Harry[/td] [td]| author3 = May, Alex | author4 = Speelman, Florian | author5 = Verduyn Lunel, Philip | title = Relating non-local quantum computation to information theoretic cryptography | journal = Quantum | volume = 8 | article-number = 1387 | year = 2024 | publisher = Verein zur FΓΆrderung des Open Access Publizierens in den Quantenwissenschaften | doi = 10.22331/q-2024-06-27-1387 | arxiv = 2306.16462 | bibcode = 2024Quant...8.1387A | url = https://quantum-journal.org/papers/q-2024-06-27-1387/}}</ref> and the [[AdS/CFT correspondence]],<ref name=holographictasks>{{cite journal | author1 = May, Alex | title = Quantum tasks in holography | journal = Journal of High Energy Physics | volume = 2019 | issue = 10 | article-number = 233 | year = 2019 | publisher = Springer | doi = 10.1007/JHEP10(2019)233 | arxiv = 1902.06845 | bibcode = 2019JHEP...10..233M | url = https://link.springer.com/article/10.1007/JHEP10(2019)233}}</ref> among other subjects.<ref>{{cite journal | author1 = Apel, Harriet | author2 = Cubitt, Toby | author3 = Hayden, Patrick | author4 = Kohler, Tamara | author5 = PΓ©rez-GarcΓa, David | title = Security of quantum position-verification limits Hamiltonian simulation via holography | journal = Journal of High Energy Physics | volume = 2024 | issue = 8 | pages = 152 | year = 2024 | publisher = Springer | doi = 10.1007/JHEP08(2024)152 | arxiv = 2401.09058 | bibcode = 2024JHEP...08..152A | url = https://link.springer.com/article/10.1007/JHEP08(2024)152}}</ref><ref>{{cite conference | author1 = Ananth, Prabhanjan | author2 = Goyal, Vipul | author3 = Liu, Jiahui | author4 = Liu, Qipeng | title = Advances in Cryptology β ASIACRYPT 2024 | chapter = Unclonable Secret Sharing | series = Lecture Notes in Computer Science | pages = 129β157 | year = 2024 | volume = 15492 | publisher = Springer | doi = 10.1007/978-981-96-0947-5_5 | isbn = 978-981-96-0946-8 | chapter-url = https://link.springer.com/chapter/10.1007/978-981-96-0947-5_5}}</ref>[/td]
[td]| author3 = May, Alex | author4 = Speelman, Florian | author5 = Verduyn Lunel, Philip | title = Relating non-local quantum computation to information theoretic cryptography | journal = Quantum | volume = 8 | article-number = 1387 | year = 2024 | publisher = Verein zur FΓΆrderung des Open Access Publizierens in den Quantenwissenschaften | doi = 10.22331/q-2024-06-27-1387 | arxiv = 2306.16462 | bibcode = 2024Quant...8.1387A | url = https://quantum-journal.org/papers/q-2024-06-27-1387/}}</ref> and the [[AdS/CFT correspondence]],<ref name=holographictasks>{{cite journal | author1 = May, Alex | title = Quantum tasks in holography | journal = Journal of High Energy Physics | volume = 2019 | issue = 10 | article-number = 233 | year = 2019 | publisher = Springer | doi = 10.1007/JHEP10(2019)233 | arxiv = 1902.06845 | bibcode = 2019JHEP...10..233M | url = https://link.springer.com/article/10.1007/JHEP10(2019)233}}</ref> among other subjects.<ref>{{cite journal | author1 = Apel, Harriet | author2 = Cubitt, Toby | author3 = Hayden, Patrick | author4 = Kohler, Tamara | author5 = PΓ©rez-GarcΓa, David | title = Security of quantum position-verification limits Hamiltonian simulation via holography | journal = Journal of High Energy Physics | volume = 2024 | issue = 8 | pages = 152 | year = 2024 | publisher = Springer | doi = 10.1007/JHEP08(2024)152 | arxiv = 2401.09058 | bibcode = 2024JHEP...08..152A | url = https://link.springer.com/article/10.1007/JHEP08(2024)152}}</ref><ref>{{cite conference | author1 = Ananth, Prabhanjan | author2 = Goyal, Vipul | author3 = Liu, Jiahui | author4 = Liu, Qipeng | title = Advances in Cryptology β ASIACRYPT 2024 | chapter = Unclonable Secret Sharing | series = Lecture Notes in Computer Science | pages = 129β157 | year = 2024 | volume = 15492 | publisher = Springer | doi = 10.1007/978-981-96-0947-5_5 | isbn = 978-981-96-0946-8 | chapter-url = https://link.springer.com/chapter/10.1007/978-981-96-0947-5_5}}</ref>[/td] [td][/td]
[td][/td] [td][[Category:Quantum algorithms]][/td]
[td][[Category:Quantum algorithms]][/td] [td][/td] [td]{{Improve categories|date=September 2025}}[/td]
Continue reading...
| Line 1: | Line 1: |
| Line 353: | Line 354: |
[td]
β Previous revision
[/td][td]
[td]{{Short description|Method of quantum computing via entanglement}}[/td]Revision as of 14:19, 2 September 2025
[/td][td]{{Short description|Method of quantum computing via entanglement}}[/td] [td][/td]
[td][/td] [td]{{Orphan|date=September 2025}}[/td] [td]A '''non-local quantum computation''' (or NLQC) is a distributed method of performing a [[quantum computation]]; the method involves shared [[quantum entanglement| entanglement]] and a single, simultaneous round of communication. NLQC was initially studied as a cheating strategy in the context of [[Quantum cryptography#Position-based quantum cryptography| quantum position verification]], and has since been related to a number of other subjects including [[Quantum complexity theory|computational complexity]].,<ref name=Tgatebounds>{{cite conference |last=Speelman |first=Florian |title=Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits |series=Leibniz International Proceedings in Informatics (LIPIcs) |volume=61 |pages=9:1β9:24 |publisher=Schloss Dagstuhl β Leibniz-Zentrum fΓΌr Informatik |year=2016 |doi=10.4230/LIPIcs.TQC.2016.9 |doi-access=free}}</ref><ref name=gardenhose>{{cite conference | last1 = Buhrman | first1 = Harry | last2 = Fehr | first2 = Serge | last3 = Schaffner | first3 = Christian | last4 = Speelman | first4 = Florian | title = The garden-hose model | pages = 145β158 | year = 2013 | publisher = ACM | doi = 10.1145/2422436.2422453 | url = https://doi.org/10.1145/2422436.2422453}}</ref> aspects of classical [[Information-theoretic security|information-theoretic cryptography]],<ref name=ITC>{{cite journal | author1 = Allerstorfer, Rene | author2 = Buhrman, Harry[/td]
[td]A '''non-local quantum computation''' (or NLQC) is a distributed method of performing a [[quantum computation]]; the method involves shared [[quantum entanglement| entanglement]] and a single, simultaneous round of communication. NLQC was initially studied as a cheating strategy in the context of [[Quantum cryptography#Position-based quantum cryptography| quantum position verification]], and has since been related to a number of other subjects including [[Quantum complexity theory|computational complexity]].,<ref name=Tgatebounds>{{cite conference |last=Speelman |first=Florian |title=Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits |series=Leibniz International Proceedings in Informatics (LIPIcs) |volume=61 |pages=9:1β9:24 |publisher=Schloss Dagstuhl β Leibniz-Zentrum fΓΌr Informatik |year=2016 |doi=10.4230/LIPIcs.TQC.2016.9 |doi-access=free}}</ref><ref name=gardenhose>{{cite conference | last1 = Buhrman | first1 = Harry | last2 = Fehr | first2 = Serge | last3 = Schaffner | first3 = Christian | last4 = Speelman | first4 = Florian | title = The garden-hose model | pages = 145β158 | year = 2013 | publisher = ACM | doi = 10.1145/2422436.2422453 | url = https://doi.org/10.1145/2422436.2422453}}</ref> aspects of classical [[Information-theoretic security|information-theoretic cryptography]],<ref name=ITC>{{cite journal | author1 = Allerstorfer, Rene | author2 = Buhrman, Harry[/td] [td]| author3 = May, Alex | author4 = Speelman, Florian | author5 = Verduyn Lunel, Philip | title = Relating non-local quantum computation to information theoretic cryptography | journal = Quantum | volume = 8 | article-number = 1387 | year = 2024 | publisher = Verein zur FΓΆrderung des Open Access Publizierens in den Quantenwissenschaften | doi = 10.22331/q-2024-06-27-1387 | arxiv = 2306.16462 | bibcode = 2024Quant...8.1387A | url = https://quantum-journal.org/papers/q-2024-06-27-1387/}}</ref> and the [[AdS/CFT correspondence]],<ref name=holographictasks>{{cite journal | author1 = May, Alex | title = Quantum tasks in holography | journal = Journal of High Energy Physics | volume = 2019 | issue = 10 | article-number = 233 | year = 2019 | publisher = Springer | doi = 10.1007/JHEP10(2019)233 | arxiv = 1902.06845 | bibcode = 2019JHEP...10..233M | url = https://link.springer.com/article/10.1007/JHEP10(2019)233}}</ref> among other subjects.<ref>{{cite journal | author1 = Apel, Harriet | author2 = Cubitt, Toby | author3 = Hayden, Patrick | author4 = Kohler, Tamara | author5 = PΓ©rez-GarcΓa, David | title = Security of quantum position-verification limits Hamiltonian simulation via holography | journal = Journal of High Energy Physics | volume = 2024 | issue = 8 | pages = 152 | year = 2024 | publisher = Springer | doi = 10.1007/JHEP08(2024)152 | arxiv = 2401.09058 | bibcode = 2024JHEP...08..152A | url = https://link.springer.com/article/10.1007/JHEP08(2024)152}}</ref><ref>{{cite conference | author1 = Ananth, Prabhanjan | author2 = Goyal, Vipul | author3 = Liu, Jiahui | author4 = Liu, Qipeng | title = Advances in Cryptology β ASIACRYPT 2024 | chapter = Unclonable Secret Sharing | series = Lecture Notes in Computer Science | pages = 129β157 | year = 2024 | volume = 15492 | publisher = Springer | doi = 10.1007/978-981-96-0947-5_5 | isbn = 978-981-96-0946-8 | chapter-url = https://link.springer.com/chapter/10.1007/978-981-96-0947-5_5}}</ref>[/td]
[td]| author3 = May, Alex | author4 = Speelman, Florian | author5 = Verduyn Lunel, Philip | title = Relating non-local quantum computation to information theoretic cryptography | journal = Quantum | volume = 8 | article-number = 1387 | year = 2024 | publisher = Verein zur FΓΆrderung des Open Access Publizierens in den Quantenwissenschaften | doi = 10.22331/q-2024-06-27-1387 | arxiv = 2306.16462 | bibcode = 2024Quant...8.1387A | url = https://quantum-journal.org/papers/q-2024-06-27-1387/}}</ref> and the [[AdS/CFT correspondence]],<ref name=holographictasks>{{cite journal | author1 = May, Alex | title = Quantum tasks in holography | journal = Journal of High Energy Physics | volume = 2019 | issue = 10 | article-number = 233 | year = 2019 | publisher = Springer | doi = 10.1007/JHEP10(2019)233 | arxiv = 1902.06845 | bibcode = 2019JHEP...10..233M | url = https://link.springer.com/article/10.1007/JHEP10(2019)233}}</ref> among other subjects.<ref>{{cite journal | author1 = Apel, Harriet | author2 = Cubitt, Toby | author3 = Hayden, Patrick | author4 = Kohler, Tamara | author5 = PΓ©rez-GarcΓa, David | title = Security of quantum position-verification limits Hamiltonian simulation via holography | journal = Journal of High Energy Physics | volume = 2024 | issue = 8 | pages = 152 | year = 2024 | publisher = Springer | doi = 10.1007/JHEP08(2024)152 | arxiv = 2401.09058 | bibcode = 2024JHEP...08..152A | url = https://link.springer.com/article/10.1007/JHEP08(2024)152}}</ref><ref>{{cite conference | author1 = Ananth, Prabhanjan | author2 = Goyal, Vipul | author3 = Liu, Jiahui | author4 = Liu, Qipeng | title = Advances in Cryptology β ASIACRYPT 2024 | chapter = Unclonable Secret Sharing | series = Lecture Notes in Computer Science | pages = 129β157 | year = 2024 | volume = 15492 | publisher = Springer | doi = 10.1007/978-981-96-0947-5_5 | isbn = 978-981-96-0946-8 | chapter-url = https://link.springer.com/chapter/10.1007/978-981-96-0947-5_5}}</ref>[/td] [td][/td]
[td][/td] [td][[Category:Quantum algorithms]][/td]
[td][[Category:Quantum algorithms]][/td] [td][/td] [td]{{Improve categories|date=September 2025}}[/td]
Continue reading...
