Researchers at IQC have made significant contributions to a Post-Quantum Cryptography standardization process run by the National Institute for Standards and Technology (NIST). As the process enters its fourth round, researchers are one step closer to identifying codes that will be widely accepted as reliable and safe against attacks enabled by emerging quantum computers.
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
Dynamic qubit allocation and routing for constrained topologies by CNOT circuit re-synthesis
Recent strides in quantum computing have made it possible to execute quantum algorithms on real quantum hardware. When mapping a quantum circuit to the physical layer, one has to consider the numerous constraints imposed by the underlying hardware architecture. Many quantum computers have constraints regarding which two-qubit operations are locally allowed. For example, in a superconducting quantum computer, connectivity of the physical qubits restricts multi-qubit operations to adjacent qubits . These restrictions are known as connectivity constraints and can be represented by a connected graph (a.k.a. topology), where each vertex represents a distinct physical qubit. When two qubits are adjacent, there is an edge between the corresponding vertices.
Andrey Boris Khesin - Massachusetts Institute of Technology
Publicly verifiable quantum money is a protocol for the preparation of quantum states that can be efficiently verified by any party for authenticity but is computationally infeasible to counterfeit. We develop a cryptographic scheme for publicly verifiable quantum money based on Gaussian superpositions over random lattices. We introduce a verification-of-authenticity procedure based on the lattice discrete Fourier transform, and subsequently prove the unforgeability of our quantum money under the hardness of the short vector problem from lattice-based cryptography.
Felix Motzoi - University of California
In the NISQ era of quantum computing, as system sizes are progressively increasing, there are major concerns about the degradation of performance with increasing complexity. These can largely be reduced to the problems of crosstalk and correlations between system components, of fabrication uncertainties and drift in system parameters, and of multi-parameter optimization across multi-qubit state spaces in a fixed uptime duty cycle. In this presentation, we address inroads towards a more comprehensive, scalable approach for control theoretic solutions to maintaining (given architecture) performance that encompasses: a method to incorporate arbitrary couplings into an effective Hamiltonian frame with superexponential speedup compared to standard perturbative approaches [B. Li, T. Calarco, F. Motzoi, PRX Quantum 3, 030313 (2022)]; a control theoretic approach to tracking uncertainties in quantum circuits giving tight error bounds [M. Dalgaard, C. Weidner, F, Motzoi - Phys. Rev. Lett. 128, 150503 (2022)]; and a machine learning framework for symbolic optimization given particular Hamiltonian and associated uncertainties with a single meta-optimization permitting simultaneous tuneup of all qubits within the architecture belonging to the same class of Hamiltonians [F. Preti, T. Calarco, F. Motzoi, arXiv:2203.13594 (2022)].