(The Virtual) July 28, 2020 NYC Quantum Computing Meetup

Yong Yao will talk - virtually - about Computational Complexity on Tuesday, July 28, 2020 at 6pm.

(Please sign up and I'll post the zoom details to attendees next week.)

Abstract:

Yong Yao will cover the main concepts, methods, results and open problems in classic computational complexity theory..

Key topics are:

Complexity classes and their properties
Isomorphism Conjecture, NP-complete set and dense set
One-way functions, circuit complexity, and pseudorandomness
Interactive proof system, PCP theorem and Zero-Knowledge proof
The Unique Games Conjecture
Average-case complexity
Dealing with NP-hard problems
Phase transition in NP-Complete problem
P vs NP
Quantum Computational Complexity

He'll conclude by discussing the interaction between computational complexity theory and physics, human intelligence and P vs NP.

Bio:

Yong Yao:

Currently works on fixed income research at LSEG.

Has research experiences in computational complexity, approximation algorithms, packing and Latin squares in Huazhong university of science and technology (China). In his Latin square research he created an object function inspired by physics and proved the optimal point of the function corresponds to the existence of Latin square.

Has research experiences in circuitry complexity, algebraic complexity. bioinformatics, quasi Monte Carlo simulation (in CDS and EDS pricing), and quantum computing at Temple university (USA).

Has 10+ years working experience in financial technology (IT, rating, performance attribution, quantitative trading, transaction cost analysis, etc) at Moodys, Wells Fargo, Barclays, and Oriental Futures (Shanghai ).
Still keep strong interest in computational complexity theory especially quantum computing related topics.