EvolutionQ, a leading quantum-safe cybersecurity company founded and led by Executive Director of the Institute for Quantum Computing Norbert Lütkenhaus, and IQC faculty member Michele Mosca, recently announced their latest partnership with SandboxAQ, an enterprise Saas company. This partnership was formed in relation to evolutionQ’s Series A funding and its recent grant of $7 million in funding, which will help organizations like SandboxAQ prepare for quantum computers.
A single-photon detector and counting module (SPODECT) recently built by Waterloo’s Quantum Photonics Lab for the International Space Station (ISS) will be used to verify quantum entanglement and test its survivability in space as part of the Space Entanglement and Annealing QUantum Experiment (SEAQUE) mission, in a collaboration with researchers at the University of Illinois Urbana-Champaign, the Jet Propulsion Laboratory, ADVR Inc, and the National University of Singapore
EvolutionQ, founded by Norbert Lütkenhaus, Executive Director of the Institute for Quantum Computing, and IQC faculty member Michele Mosca, has secured $7 million in funding for quantum-safe cybersecurity. EvolutionQ is looking to help organizations prepare themselves for quantum computers. Their Series A financing is led by Quantonation, a Paris-based, quantum technology-focused VC fund, with support from Toronto’s The Group Ventures, to “scale up” its quantum-safe cybersecurity tech.
Improved Synthesis of Restricted Clifford+T Circuits
In quantum information theory, the decomposition of unitary operators into gates from some fixed universal set is of great research interest. Since 2013, researchers have discovered a correspondence between certain quantum circuits and matrices over rings of algebraic integers. For example, there is a correspondence between a family of restricted Clifford+T circuits and the group On(Z[1/2]). Therefore, in order to study quantum circuits, we can study the corresponding matrix groups and try to solve the constructive membership problem (CMP): given a set of generators and an element of the group, how to factor this element as a product of generators? Since a good solution to CMP yields a smaller decomposition of an arbitrary group element, it helps us implement quantum circuits using fewer resources.
Noncommuting charges: Bridging theory to experiment
Noncommuting conserved quantities have recently launched a subfield of quantum thermodynamics. In conventional thermodynamics, a system of interest and an environment exchange quantities—energy, particles, electric charge, etc.—that are globally conserved and are represented by Hermitian operators. These operators were implicitly assumed to commute with each other, until a few years ago. Freeing the operators to fail to commute has enabled many theoretical discoveries—about reference frames, entropy production, resource-theory models, etc. Little work has bridged these results from abstract theory to experimental reality. This work provides a methodology for building this bridge systematically: we present a prescription for constructing Hamiltonians that conserve noncommuting quantities globally while transporting the quantities locally. The Hamiltonians can couple arbitrarily many subsystems together and can be integrable or nonintegrable. Our Hamiltonians may be realized physically with superconducting qudits, with ultracold atoms, and with trapped ions.
Quantum measurements are inherently probabilistic. Further defying our classical intuition, quantum theory often forbids us to precisely determine the outcomes of simultaneous measurements. This phenomenon is captured and quantified through uncertainty relations. Although studied since the inception of quantum theory, this problem of determining the possible expectation values of a collection of quantum measurements remains, in general, unsolved. In this talk, we will go over some basic notions of graph theory that will allow us to derive uncertainty relations valid for any set of dichotomic quantum observables. We will then specify the many cases for which these relations are tight, depending on properties of some graphs, and discuss a conjecture for the untight cases. Finally, we will show some direct applications to several problems in quantum information, namely, in constructing entropic uncertainty relations, separability criteria and entanglement witnesses.