It is imperative to minimize resources needed to implement quantum operations on existing near-term quantum devices. With this in mind, we propose a scheme to implement an arbitrary general quantum measurement (POVM) in dimension d using only classical resources and a single ancillary qubit. The proposed method is based on probabilistic implementation of d-outcome measurements which is followed by postselection on some of the received outcomes. This is an extension of an earlier work (https://journals.aps.org/pra/abstract/10.1103/PhysRevA.100.012351) which required dichotomic measurements, no additional ancillary qubits, and whose success probability scaled like 1/d. The success probability of our scheme depends on the operator norms of the coarse grained POVM effects. For Haar random POVMs in dimension d, these properties are related to operator norms of truncations of Haar-random unitaries. Significantly, we show that for typical Haar random rank-one POVMs with at most d^2 outcomes, the success probability of our simulation scheme does not go to zero with the dimension of the system. We conjecture that this is true for all quantum measurements in dimension d. This is supported by numerical computations showing constant success probability for SIC-POVMs in dimension up to 323. Additionally, for the gate noise model used in the recent demonstration of quantum computational advantage (https://www.nature.com/articles/s41586-019-1666-5), we prove that for typical Haar random POVMs noise compounding in circuits required by our scheme is substantially lower than in the scheme that directly uses Naimark’s dilation theorem.
ZOOM link: https://zoom.us/j/6526721604?pwd=Y0pPdE9vT1hNWWNiZVBMaEVOeHN2dz09
join us at 11:15

Filip Rozpędek (Pritzker School of Molecular Engineering, University of Chicago)
We propose a novel architecture of quantum-error-correction-based quantum repeaters that combines the techniques used in discrete and continuous variable quantum information. Specifically, we propose to encode the transmitted qubits in a concatenated code consisting of two levels. On the first level we use a continuous variable GKP code which encodes the qubit in a single bosonic mode. On the second level we use a small discrete variable code, encoding a logical qubit in as few as seven physical qubits. Such an architecture introduces two major novelties which allow us to make efficient use of resources. Firstly, our architecture makes use of two types of quantum repeaters: the simpler GKP repeaters that need to only be able to store and correct errors on a single GKP qubit and more powerful but more costly multi-qubit repeaters that additionally can correct errors on the higher level. We find that the combination of using the two types of repeaters enables us to achieve performance needed in practical scenarios with a significantly reduced cost with respect to an architecture based solely on multiqubit repeaters. Secondly the use of continuous variable GKP code on the lower level has the advantage of providing us with the information about the success probability of the specific GKP correction round. This analog information, unique to bosonic codes, provides significant boost in performance when used to correct second level errors in the multi-qubit repeaters.
join us at 11:15

Piotr Migdał & Klem Jankiewicz (Quantum Flytrap)
We develop “quantum LEGO bricks” - a virtual lab and a puzzle game. Itcan be used to set the first steps in the quantum world, teach at anylevel, and prototype new experiments. Within this environment, it isalready possible to recreate interference or quantum cryptographyprotocols. It will be possible to show entanglement, Bell test,quantum teleportation, and the many-worlds interpretation.https://quantumgame.io/info/mach-zehnder-interferometerAs a part of the project, we redesign the notation for quantum states,moving it from static LaTeX to interactive formulae. We have built avisualizer for quantum states and matrices, which you can use in yourcourse (be it an interactive presentation or on your website).https://github.com/Quantum-Game/bra-ket-vue