Вход на сайт

Просмотр новости

Найдите то, что Вас интересует

A Noise Operator Approach to Quantum Time-Space Tradeoff Lower Bounds

Дата публикации: 16-09-2026 16:37:19

Speaker: Niels KornerupSpeaker Link: Niels Kornerup WebsiteSeptember 25, 2026ESB 4133
CanadaView All EventsAbstract: Time and space are the most important measures of cost in computation, even more so for quantum computation, where coherence times and logical qubit counts are critically constrained resources. Despite this, our tools for establishing unconditional tradeoff lower bounds between time and space in quantum computation are surprisingly limited. In this talk, we present an Omega(n^{4/3} (log log n)/(S^{1/3} log n)) non output oblivious quantum time-space tradeoff lower bound for sorting and an Omega(mn/S) output oblivious quantum time-space tradeoff lower bound for universal hashing from n bits to m bits. These new tradeoffs are proven with a novel method based off the noise operator that lets us upper bound the success probability of quantum query algorithms using a purely classical argument.
A Noise Operator Approach to Quantum Time-Space Tradeoff Lower Bounds

Основное содержимое страницы с новостью.

Speaker: 

Niels Kornerup

Speaker Link: 

Niels Kornerup Website

September 25, 2026

ESB 4133

Canada

View All Events

Abstract: 

Time and space are the most important measures of cost in computation, even more so for quantum computation, where coherence times and logical qubit counts are critically constrained resources. Despite this, our tools for establishing unconditional tradeoff lower bounds between time and space in quantum computation are surprisingly limited. In this talk, we present an Omega(n^{4/3} (log log n)/(S^{1/3} log n)) non output oblivious quantum time-space tradeoff lower bound for sorting and an Omega(mn/S) output oblivious quantum time-space tradeoff lower bound for universal hashing from n bits to m bits. These new tradeoffs are proven with a novel method based off the noise operator that lets us upper bound the success probability of quantum query algorithms using a purely classical argument.

Event Details

September 25, 2026

1:00pm to 2:00pm

ESB 4133

, , CA

View Map

Схожие новости

#Наименование новостиТональностьИнформативностьДата публикации
1New benchmark puts quantum computers to the test and reveals their limitations06.3117-09-2026
2Spin rephasing helps quantum memories store single-photon states longer for future networks07.4425-09-2026
3memQ Unleashes Open Quantum Compiler Across Networks06.525-09-2026
4Type B bosonic-fermionic coinvariant rings01616-09-2026
5Permutations with no long increasing subsequences015.116-09-2026
6 A filtered basis for Haiman ideals015.4724-09-2026
7В России открыли продажи квантовых компьютеров SnowDrop014.3125-09-2026
8Post-Quantum-Sicherheit wird zur Realität: BearingPoint bringt quantensichere Kryptographie in kritische Systeme015.2627-05-2026
9The Study of Wave Turbulence: A Meeting Ground for Mathematical Techniques (PIMS network-wide colloquium) [rescheduled]015.7426-09-2026
10This UCD expert is building advanced quantum sensing tech07.1422-09-2026

Классификация: . Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 16. Источник: www.math.ubc.ca.