BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Qureca - ECPv6.16.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Qureca
X-ORIGINAL-URL:https://www.qureca.com
X-WR-CALDESC:Events for Qureca
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Shanghai
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:CST
DTSTART:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Shanghai:20200724T170000
DTEND;TZID=Asia/Shanghai:20200724T180000
DTSTAMP:20260526T152005
CREATED:20240408T145330Z
LAST-MODIFIED:20240408T145331Z
UID:10000002-1595610000-1595613600@www.qureca.com
SUMMARY:Executing Deep Quantum Optimization Algorithms on Superconducting Quantum Processors
DESCRIPTION:Superconducting circuits are a prime contender both for realizing fault-tolerant quantum processors and for executing noisy intermediate-scale quantum (NISQ) algorithms. After a brief introduction to the quantum physics of superconducting circuits I will focus on the latter. The quantum approximate optimization algorithm (QAOA) is one of a whole class of variational methods\, which are believed to be promising to solve computationally hard problems on quantum computers. Also\, the performance of noisy intermediate-scale quantum information processing systems is commonly benchmarked using such algorithms. Gaining computational power from QAOA critically relies on the mitigation of errors during the execution of the algorithm\, which for coherence-limited operations is achievable by reducing the gate count. Here\, I present an improvement of up to a factor of three in algorithmic performance\, by implementing a continuous hardware-efficient gate set. This gate set allows us to perform the phase separation step in QAOA with a single operation for each pair of qubits instead of decomposing it into multiple gates. We experimentally investigate the circuit-depth-dependent performance of our QAOA implementations for finding solutions to exact cover problems mapped onto three or seven qubits using up to a total of 399 operations in up to 9 layers. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers [1]. Using the same device architecture\, we have recently demonstrated repeated error detection [2]\, an important step toward quantum error correction and the execution of fault-tolerant quantum algorithms. \nReferences\n[1] N. Lacroix et al.\, arXiv:2005.05275 (2020)\n[2] C. K. Andersen et al.\, Nat. Phys. (2020). https://doi.org/10.1038/s41567-020-0920-y \n(Online Event)
URL:https://www.qureca.com/calendar/executing-deep-quantum-optimization-algorithms-on-superconducting-quantum-processors/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Shanghai:20200723T160000
DTEND;TZID=Asia/Shanghai:20200723T170000
DTSTAMP:20260526T152005
CREATED:20240408T145330Z
LAST-MODIFIED:20240408T145331Z
UID:10000001-1595520000-1595523600@www.qureca.com
SUMMARY:A review of entangled photon pair sources based on three-wave mixing in bulk crystals
DESCRIPTION:Entangled photon-pairs are a vital resource in quantum information protocols ranging from quantum key distribution to teleportation. The commonly used technique for generating photon-pairs is by a three-wave mixing process called spontaneous parametric down-conversion (SPDC) in bulk crystals. The increased demand of quality entangled photon-pair sources for various applications and the readily available technology to build the sources have led to a growing research interest in deployable high performance entangled photon-pair sources. In this talk\, I will give a review of the state-of-the-art for bulk optics based SPDC sources and discuss some of the main considerations when building a source. \n(Online Event)
URL:https://www.qureca.com/calendar/a-review-of-entangled-photon-pair-sources-based-on-three-wave-mixing-in-bulk-crystals/
END:VEVENT
END:VCALENDAR