【学术视频】第二十三届量子信息处理年会集锦

原创 KouShare 蔻享学术 2021-04-25

更多精彩视频登陆网站

www.koushare.com

由南方科技大学、深圳量子科学与工程研究院、鹏城实验室主办的23rd Annual Conference on Quantum Information Processing（第二十三届量子信息处理年会）于2020年1月4日开始在深圳举行。

QIP 2020 will be held from January 6 to 10, 2020 at Shenzhen, China, with tutorials taking place on January 4 and 5. It is jointly hosted by Shenzhen Institute for Quantum Science and Engineering (SIQSE, Southern University of Science and Technology) and Center for Quantum Computing (CQC, Peng Cheng Laboratory). It is the twenty-third international conference on theoretical aspects of quantum computing, quantum cryptography, and quantum information in a series that started in Aarhus in 1998 and was last held in 2019 in Boulder, USA.

此次会议共授权录制74个报告，可扫描下方二维码或点击下方“阅读原文”观看精彩视频。

扫码观看精彩报告视频

报告人	单位	题目
杨宇祥	Swiss Federal Institute of Technology Zurich	Energy requirement of quantum information processing
Hiroyasu Tajima	Research Gate	Coherence costs for quantum computation and measurement under conservation laws
Guang Hao Low	Microsoft	Trading T-gates for dirty qubits in state preparation and unitary synthesis
Futian Liang	中国科学技术大学	Introduction to the ez-Q Engine Tools Kit
Alexander Dalzell	California Institute of Technology, USA	Locally accurate MPS approximations for ground states of one-dimensional gapped local Hamiltonians
Vadym Kliuchnikov	Microsoft Quantum, Redmond, Washington, US	Lower bounds on the non-clifford resources for quantum computations
Nie Jimin	CAS Quantum Network Co., Ltd.	Chinese perspectives on quantum key distribution network
Hamoon Mousavi	University of Toronto	A generalization of CHSH and the algebraic structure of optimal strategies
Ojas Parekh	Sandia National Labs	Almost optimal classical approximation algorithms for a quantum generalization of Max Cut
James Watson	University College London, UK	The Uncomputability of Phase Diagrams
Albert H. Werne	QMATH - University of Copenhagen	Tensor network representations from the geometry of entangled states
傅泓皓	University of Maryland,College Park	Constant-sized correlations are sufficient to self-test maximally entangled states of unbounded dimension
Axel Dahlberg	QuTech Academy Delft University of Technology	On the complexity of transforming graph states using local Clifford operations, Pauli measurements and classical communication
Sepehr Nezami & Mischa Woods	California Institute of Technology & ETH Zürich	A robust Eastin -Knill theorem with applications beyond quantum computation
Lijing Jin	Institute for Quantum Computing, Baidu Research	Quantum Computing at Baidu
宿愿	University of Maryland	A Theory of Trotter Error
Ernest Y.-Z. Tan	ETH Zürich	Computing secure key rates for QKD with untrusted devices
David Gosset	University of Waterloo	Classical algorithms for quantum mean values
Narayanan Rengaswamy	Duke University	On Optimality of CSS Codes for Transversal T
Justin Yirka	The University of Texas at Austin, USA	Oracle complexity classes and local measurements on physical Hamiltonians
王春昊	University of Texas at Austin	Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
André Schrottenloher	Inria, France	Quantum Attacks without Superposition Queries: the Offline Simon's Algorithm
Alexandru Gheorghiu	California Institute of Technology	Computationally-Secure and Composable Remote State Preparation
王鑫	香港城巿大学	Quantifying the magic resources for quantum computation
Yinan Li	The Haemers Bound of Noncommutative Graphs	The Haemers Bound of Noncommutative Graphs
Kun Fang	University of Cambridge	Chain rules for quantum relative entropies and their applications
Chong Sun	California Institute Of Technology	Quantum imaginary time evolution
乔友明	University of Technology Sydney	General linear group action on tensors: a candidate for post-quantum cryptography
Daniel Grier	Kuke Schaeffer University of Waterloo	Interactive Shallow Clifford Circuits: Quantum advantage against NC¹ and beyond
Nick Spooner	University of California, Berkeley	Succinct Arguments in the Quantum Random Oracle Model
Benjamin J. Brown	The university of Sydney	High thresholds from symmetries of quantum codes
Naresh Goud Boddu	Centre for Quantum Technologies, NUS, Singapore	Exponential Separation between Quantum Communication and Logarithm of Approximate Rank
Marco Tomamichel	University of Technology Sydney	Quantum advantage with noisy shallow circuits in 3D
Henry Yuen	University of Toronto	Zero knowledge for quantum multiprover interactive proofs
Anand Natarajan	California Institute of Technology	NEEXP contained in MIP
Robin Kothari	Microsoft	Quantum Lower Bounds for Approximate Counting via Laurent Polynomials
Masahito Hayashi	Nagoya University, Japan	Efficient verification of pure quantum states in the adversarial scenario
Tomotaka Kuwahara	RIKEN AIP, RIKEN iTHEMS, Keio University, Japan	Area law and clustering of information in non-critical long-range interacting systems
Andris Ambainis	University of Latvia	Quadratic speedup for finding marked vertices by quantum walk
Eugene Tang	California Institute of Technology	Obstacles to State Preparation and Variational Optimization from Symmetry Protection
Ewin Tang	University of Washington	Quantum-inspired algorithms for recommendation systems, supervised clustering, and principal component analysis
Felix Leditzky	Institute for Quantum Computing ，University of Waterloo	Error thresholds for arbitrary Pauli noise
Manaswi Paraashar	Indian Statistical Institute, Kolkata	The Logarithmic Overhead in the BCW Quantum Query-to-Communication Simulation is Necessary
Uma Girish	Princeton University	Quantum versus Randomized Communication Complexity, with Efficient Players
Marco Túlio Quintino	The University of Tokyo	Adaptive circuits exponentially outperform parallel ones for universal unitary inversion
Jonathan Barrett	University of Oxford	Quantum Causal Models
Tongyang Li	University of Maryland	Quantum algorithm for estimating volumes of convex bodies
姚鹏晖	南京大学	A doubly exponential upper bound on noisy EPR states for binary games
Ashutosh Goswami	Université Grenoble Alpes, Grenoble, France / CEA-Leti, MINATEC, Grenoble, France	Purely Quantum Polar Codes
王鑫	香港城巿大学	Resource theory of asymmetric distinguishability An information-theoretic treatment of quantum dichotomies
袁骁	University Of Oxford	Robustness of Quantum Memories An Operational Resource-Theoretic Approach
Sergio Boixo	Google Al Quantum	Quantum Supremacy using a Programmable Superconducting Processor
黄信元	Institute of Quantum Information and Matter (IQIM), Caltech	Predicting Features of Quantum Systems using Classical Shadows
Aleksander Kubica	Perimeter Institute	Color code decoding in d≥2 dimensions
Alex Bredariol Grilo	Centrum Wiskunde & Informatica and Research Center for Quantum Software	Stoquastic PCP vs. Randomness
Anurag Anshu	Institute for Quantum Computing and Perimeter Institute for Theoretical Physics, Waterloo	Entanglement subvolume law for 2D frustration free spin systems
Victor V. Albert	California Institute of Technology	Robust Encoding of a Qubit in a Molecule
Nilin Abrahamsen	Massachusetts Institute of Technology	A polynomial-time algorithm for ground states of spin trees
Mischa Woods	ETH Zurich, Switzerland	The Resource Theoretic Paradigm of Quantum Thermodynamics with Control
Cupjin Huang	Alibaba damo academy	Explicit lower bounds on strong quantum simulation
Alex Bredariol Grilo	Centrum Wiskunde & Informatica and Research Center for Quantum Software	Quantum hardness of learning shallow classical circuits
Mithuna Yoganathan	University of Cambridge	The one clean qubit model without entanglement is classically simulable
Nai Hui Chia	University of Texas at Austin	On the Need for Large Quantum Depth
Nick Hunter Jones	Perimeter Institute	Models of quantum complexity growth
Guang Hao Low	Microsoft	Well-conditioned multiproduct Hamiltonian simulation
Carl Alexander Miller	National Institute of Standards and Technology, United States of America	The Impossibility of Efficient Quantum Weak Coin-Flipping
Christian Majenz	University of amsterdam	Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model
Kenneth Brown	Duke University	The Fault is in Our Qubits
Ramis Movassagh	Ramis Movassagh	Cayley Path and Quantum Supremacy
William J. Huggins	University of California Berkeley	Efficient and noise resilient measurements for vqe
Dominic W. Berry	MACQUARIE University	Qubitization of arbitrary basis quantum chemistry leveraging sparsity and low rank factorization
András Gilyén	Institute for Quantum Information and Matter California Institute of Technology	Quantum Algorithms Tutorial
文小刚	Massachusetts Institute of Technology	Quantum information meets quantum matter
Benjamin J. Brown	The university of Sydney	Quantum error correction Pt. II-Topological codes and decoding
Gilad Gour	University of Calgary	Quantum Resource Theories