default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYi-Kai Liu 0001
Person information
- affiliation: National Institute of Standards and Technology, Gaithersburg, MD, USA
Other persons with the same name
- Yi-Kai Liu 0002 — Xidian University, Xi'an, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i17]Zhenning Liu, Dhruv Devulapalli, Dominik Hangleiter
, Yi-Kai Liu, Alicia J. Kollár, Alexey V. Gorshkov, Andrew M. Childs:
Efficiently verifiable quantum advantage on near-term analog quantum simulators. CoRR abs/2403.08195 (2024)- [i16]Joel Rajakumar, James D. Watson, Yi-Kai Liu:
Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth. CoRR abs/2403.14607 (2024) - 2023
- [i15]Yi-Kai Liu:
An Uncertainty Principle for the Curvelet Transform, and the Infeasibility of Quantum Algorithms for Finding Short Lattice Vectors. CoRR abs/2310.03735 (2023) - 2021
- [i14]Alireza Seif, Mohammad Hafezi, Yi-Kai Liu:
Compressed Sensing Measurement of Long-Range Correlated Noise. CoRR abs/2105.12589 (2021)
2010 – 2019
- 2019
- [i13]Travis L. Scholten, Yi-Kai Liu, Kevin C. Young, Robin Blume-Kohout:
Classifying single-qubit noise using machine learning. CoRR abs/1908.11762 (2019) - 2018
- [j4]Stephen P. Jordan, Yi-Kai Liu:
Quantum Cryptanalysis: Shor, Grover, and Beyond. IEEE Secur. Priv. 16(5): 14-21 (2018) - [j3]Peter Bierhorst, Emanuel Knill, Scott Glancy, Yanbao Zhang, Alan Mink, Stephen P. Jordan, Andrea Rommal, Yi-Kai Liu, Bradley Christensen, Sae Woo Nam, Martin J. Stevens, Lynden K. Shalm:
Experimentally generated randomness certified by the impossibility of superluminal signals. Nat. 556(7700): 223-226 (2018) - [j2]Felix Krahmer, Yi-Kai Liu:
Phase Retrieval Without Small-Ball Probability Assumptions. IEEE Trans. Inf. Theory 64(1): 485-500 (2018) - [c11]Zhengfeng Ji, Yi-Kai Liu, Fang Song:
Pseudorandom Quantum States. CRYPTO (3) 2018: 126-152 - [i12]Ingo Roth, Richard Kueng, Shelby Kimmel, Yi-Kai Liu, David Gross, Jens Eisert, Martin Kliesch:
Recovering quantum gates from few average gate fidelities. CoRR abs/1803.00572 (2018) - [i11]Zhengfeng Ji, Yi-Kai Liu, Fang Song:
Pseudorandom Quantum States. IACR Cryptol. ePrint Arch. 2018: 544 (2018) - 2017
- [i10]Vedran Dunjko, Yi-Kai Liu, Xingyao Wu, Jacob M. Taylor:
Super-polynomial separations for quantum-enhanced reinforcement learning. CoRR abs/1710.11160 (2017) - [i9]Zhengfeng Ji, Yi-Kai Liu, Fang Song:
Pseudorandom States, Non-Cloning Theorems and Quantum Money. CoRR abs/1711.00385 (2017) - 2016
- [i8]Felix Krahmer, Yi-Kai Liu:
Phase Retrieval Without Small-Ball Probability Assumptions. CoRR abs/1604.07281 (2016) - 2015
- [j1]Anima Anandkumar, Dean P. Foster, Daniel J. Hsu, Sham M. Kakade, Yi-Kai Liu:
A Spectral Algorithm for Latent Dirichlet Allocation. Algorithmica 72(1): 193-214 (2015) - [c10]Yi-Kai Liu:
Privacy Amplification in the Isolated Qubits Model. EUROCRYPT (2) 2015: 785-814 - [i7]Shelby Kimmel, Yi-Kai Liu:
Phase Retrieval Using Unitary 2-Designs. CoRR abs/1510.08887 (2015) - 2014
- [c9]Yi-Kai Liu:
Single-Shot Security for One-Time Memories in the Isolated Qubits Model. CRYPTO (2) 2014: 19-36 - [c8]Yi-Kai Liu:
Building one-time memories from isolated qubits: (extended abstract). ITCS 2014: 269-286 - [i6]Yi-Kai Liu:
Single-shot security for one-time memories in the isolated qubits model. CoRR abs/1402.0049 (2014) - [i5]Yi-Kai Liu:
Single-shot security for one-time memories in the isolated qubits model. IACR Cryptol. ePrint Arch. 2014: 455 (2014) - 2013
- [i4]Yi-Kai Liu:
Building one-time memories from isolated qubits. CoRR abs/1304.5007 (2013) - 2012
- [c7]Anima Anandkumar, Dean P. Foster, Daniel J. Hsu, Sham M. Kakade, Yi-Kai Liu:
A Spectral Algorithm for Latent Dirichlet Allocation. NIPS 2012: 926-934 - [i3]Animashree Anandkumar, Dean P. Foster, Daniel J. Hsu, Sham M. Kakade, Yi-Kai Liu:
Two SVDs Suffice: Spectral decompositions for probabilistic topic modeling and latent Dirichlet allocation. CoRR abs/1204.6703 (2012) - 2011
- [c6]Andris Ambainis, Andrew M. Childs, Yi-Kai Liu:
Quantum Property Testing for Bounded-Degree Graphs. APPROX-RANDOM 2011: 365-376 - [c5]Yi-Kai Liu:
Universal low-rank matrix recovery from Pauli measurements. NIPS 2011: 1638-1646 - [i2]Yi-Kai Liu:
Universal low-rank matrix recovery from Pauli measurements. CoRR abs/1103.2816 (2011) - 2010
- [i1]Andris Ambainis, Andrew M. Childs, Yi-Kai Liu:
Quantum property testing for bounded-degree graphs. CoRR abs/1012.3174 (2010)
2000 – 2009
- 2009
- [c4]Yi-Kai Liu:
Quantum algorithms using the curvelet transform. STOC 2009: 391-400 - 2006
- [c3]Yi-Kai Liu:
Consistency of Local Density Matrices Is QMA-Complete. APPROX-RANDOM 2006: 438-449 - [c2]Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio:
On Bounded Distance Decoding for General Lattices. APPROX-RANDOM 2006: 450-461 - 2005
- [c1]Alberto Blanc, Yi-Kai Liu, Amin Vahdat:
Designing incentives for peer-to-peer routing. INFOCOM 2005: 374-385
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
