Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Stefan Leichenauer"'
Autor:
Evan Peters, João Caldeira, Alan Ho, Stefan Leichenauer, Masoud Mohseni, Hartmut Neven, Panagiotis Spentzouris, Doug Strain, Gabriel N. Perdue
Publikováno v:
npj Quantum Information, Vol 7, Iss 1, Pp 1-5 (2021)
Abstract Quantum kernel methods show promise for accelerating data analysis by efficiently learning relationships between input data points that have been encoded into an exponentially large Hilbert space. While this technique has been used successfu
Externí odkaz:
https://doaj.org/article/68962ca062724054a7cdabe34f6649a1
Autor:
Adam R. Brown, Hrant Gharibyan, Stefan Leichenauer, Henry W. Lin, Sepehr Nezami, Grant Salton, Leonard Susskind, Brian Swingle, Michael Walter
Publikováno v:
PRX Quantum, Vol 4, Iss 1, p 010320 (2023)
With the long-term goal of studying models of quantum gravity in the lab, we propose holographic teleportation protocols that can be readily executed in table-top experiments. These protocols exhibit similar behavior to that seen in the recent traver
Externí odkaz:
https://doaj.org/article/6d26d4696ab54ce4a57eaf772af6b6bd
Autor:
Sepehr Nezami, Henry W. Lin, Adam R. Brown, Hrant Gharibyan, Stefan Leichenauer, Grant Salton, Leonard Susskind, Brian Swingle, Michael Walter
Publikováno v:
PRX Quantum, Vol 4, Iss 1, p 010321 (2023)
In Brown et al. [PRX Quantum, 4, 010321 (2023)], we discuss how holographic quantum gravity may be simulated using quantum devices and we give a specific proposal—teleportation by size and the phenomenon of size winding. Here, we elaborate on what
Externí odkaz:
https://doaj.org/article/114812f777dd4147a7dcbbf17d391900
Autor:
Stefan Leichenauer, Adam Levine
Publikováno v:
Journal of High Energy Physics, Vol 2019, Iss 1, Pp 1-15 (2019)
Abstract We prove a lower bound on the integrated null energy along achronal geodesic segments using induced gravity on a brane in AdS/CFT. The bound follows from the assumption that bulk causality respects brane causality, and matches a bound recent
Externí odkaz:
https://doaj.org/article/239a64cac0ae46718d0db847480c901d
Publikováno v:
Physical Review Research, Vol 2, Iss 3, p 033402 (2020)
The quantum approximate optimization algorithm (QAOA) is widely seen as a possible usage of noisy intermediate-scale quantum (NISQ) devices. We analyze the algorithm as a bang-bang protocol with fixed total time and a randomized greedy optimization s
Externí odkaz:
https://doaj.org/article/4afdcdaca46944e88fd159bbbc3d907f
Publikováno v:
Physical Review Research, Vol 2, Iss 2, p 023074 (2020)
The quantum approximate optimization algorithm (QAOA) is a standard method for combinatorial optimization with a gate-based quantum computer. The QAOA consists of a particular ansatz for the quantum circuit architecture, together with a prescription
Externí odkaz:
https://doaj.org/article/da35c33152ac445a97315dfd5216dc52
Autor:
David Joseph, Rafael Misoczki, Marc Manzano, Joe Tricot, Fernando Dominguez Pinuaga, Olivier Lacombe, Stefan Leichenauer, Jack Hidary, Phil Venables, Royal Hansen
Publikováno v:
Nature. 605(7909)
Quantum computers are expected to break modern public key cryptography owing to Shor's algorithm. As a result, these cryptosystems need to be replaced by quantum-resistant algorithms, also known as post-quantum cryptography (PQC) algorithms. The PQC
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3050ff88d30e9dba4b5d1a45b135d97
https://pubmed.ncbi.nlm.nih.gov/35546191
https://pubmed.ncbi.nlm.nih.gov/35546191
Autor:
Doug Strain, Evan Peters, João Caldeira, Alan Ho, Hartmut Neven, Masoud Mohseni, Panagiotis Spentzouris, Gabriel Perdue, Stefan Leichenauer
Publikováno v:
npj Quantum Information, Vol 7, Iss 1, Pp 1-5 (2021)
We present a quantum kernel method for high-dimensional data analysis using Google's universal quantum processor, Sycamore. This method is successfully applied to the cosmological benchmark of supernova classification using real spectral features wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9e58cb94709e38870329e861df5c942
http://arxiv.org/abs/2101.09581
http://arxiv.org/abs/2101.09581
The quantum approximate optimization algorithm (QAOA) is widely seen as a possible usage of noisy intermediate-scale quantum (NISQ) devices. We analyze the algorithm as a bang-bang protocol with fixed total time and a randomized greedy optimization s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c18e291650ca9abffd2ffcc44e72fe8e
http://arxiv.org/abs/2005.13103
http://arxiv.org/abs/2005.13103
Publikováno v:
Physical Review Research. 2
The Quantum Approximate Optimization Algorithm (QAOA) is a standard method for combinatorial optimization with a gate-based quantum computer. The QAOA consists of a particular ansatz for the quantum circuit architecture, together with a prescription
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a61322c9a52d6a9da62b9bbe3949fdb8
https://doi.org/10.1103/physrevresearch.2.023074
https://doi.org/10.1103/physrevresearch.2.023074