📣 همکاوی ۳:
آقای دکتر مهرداد طهماسبی
- مدال طلای المپیاد کشوری کامپیوتر و برنز فیزیک
- مدال نقره المپیاد جهانی کامپیوتر
- برنده جایزه بهترین پایان نامه دکترا Sigma Xi از دانشگاه جورجیا تک
- پژوهشگر پسادکترای دانشگاه ایلینویز (به زودی هیئت علمی)


💭 موضوع:
On the Cost of Simulation of Quantum Computing


⏳ زمان:
دوشنبه ۱۵ مرداد ۱۴۰۳ ساعت ۱۸:۳۰ به وقت ایران -
۵ آگوست ساعت ۱۱ صبح به وقت ساحل شرقی (۸ ساحل غربی)آمریکا-
۱۶ عصر به وقت اروپای مرکزی

🎥 پیوند:
https://ethz.zoom.us/j/64162924397


📜 چکیده:
In this talk, we explore the limits of a method of simulation of quantum computers over classical computers through stabilizer formalism. The stabilizer rank of a quantum state is the minimum number of terms in any approximate decomposition of that state into stabilizer states. Bravyi and Gosset showed that the approximate stabilizer rank of a so-called magic state, up to polynomial factors, is an upper bound on the number of classical operations required to simulate an arbitrary quantum circuit. As a result, an exponential lower bound on this quantity seems inevitable. Despite this intuition, several attempts using various techniques could not lead to a better than linear lower bound. I will introduce a quadratic lower bound on the approximate rank of magic states for a wide range of approximation parameters. Our approach is based on a strong lower bound on the approximate rank of a quantum state sampled from the Haar measure, a step-by-step analysis of the approximate rank of a magic-state teleportation protocol to sample from the Haar measure, and a result about trading Clifford operations with T gates.