Tag: Talks

Computational Complexity and Extended Clifford Circuits

Posted on by

11:00 Thu 30 Aug – RED 351 11:00 Mon 03 Sep – RED 351 11:00 Wed 05 Sep – RED 359 11:00 Fri 07 Sep – RED 359 Biography. Dax Enshan Koh (Skoltech Summer Intern 2018 – Biamonte Group) is a PhD candidate in the Mathematics department at the Massachusetts Institute of Technology (MIT), advised by Professor Peter Shor. His current research interests include quantum computation and quantum information, computational complexity theory, classical simulation of quantum computation, foundations of quantum mechanics as well as the theoretical underpinnings of quantum supremacy experiments. Prior to MIT, Dax completed the Perimeter Scholars International (PSI) Master’s program in Physics at the Perimeter Institute for[…]

Entanglement in quantum spin chains

Posted on by

Vladimir Korepin, Professor, C. N. Yang Institute for Theoretical Physics, Stony Brook University of Sciences 02 August 2018, 15:00-16:00 SkolTech, TPOC-4, Nobel str. 2, Blue Building, 4th floor, Room 407   ABSTRACT. Spin chains are models of realistic quantum devices. They can be realized in optical lattices and appear in un-isotropic crystalline structures in solid state. History of quantum entanglement and spin chains will be explained. The entanglement measures the level of quantum fluctuations. Different spin chains will be reviewed. The chains with highest level of fluctuations will be singled out. Short BIO. Vladimir Korepin is a theoretical and mathematical physicist. He did his undergraduate in Leningrad State University on Mathematical Physics,[…]

Unusual properties of quantum walks

Posted on by

Alexander Rivosh, Researcher, the Center for Quantum Computer Science, University of Latvia 24 July 2018, 15:00-16:30 SkolTech, TPOC-4, Nobel str. 1, Red Building, 3rd floor, Room 351   ABSTRACT. Quantum walks proved to be a useful tool for the design of quantum algorithms. Local search, element distinctness, NAND formula evaluation – that is only a few examples for problems where quantum walk based algorithms exist. We consider quantum walk as an algorithmic tool to perform a search on different graphs. We have to take into account an existence of the whole class of exceptional configurations when we use a quantum walk for search applications. Quantum walk based search algorithms fail to[…]

Machine learning model quantum systems and compounds

Posted on by

Dmitry Yudin, Researcher, ITMO University (Saint-Petersburg, Russia) 04 July 2018, 15:00-16:30 SkolTech, TPOC-4, Nobel str. 1, Red Building, 3rd floor, Room 351   ABSTRACT. Recently, a deep connection between physics of interacting quantum systems and machine learning technique has been pointed out. In fact, both of the fileds deal with systems with an extremely large number of degrees of freedom. In physics this problem is solved within coarse-grained modeling which reduces a complex many-body system to a more simplified one. Whereas in machine learning routine one typically employs dimensional reduction in the data space. In this talk we discuss how to use both supervised and unsupervised machine learning to classify[…]

Quantum Sinkhorn’s theorem and applications in quantum information theory

Posted on by

Sergey Filippov, Senior Researcher, Head of the Laboratory of Quantum Information Theory, Moscow Institute of Physics and Technology; Researcher at Microstructuring and Submicron Devises Laboratory, Institute of Physics and Technology of Russian Academy of Sciences 06 July 2018, 15:00-16:30 Skoltech, TPOC-4, Nobel str. 1, Red Building, 3rd floor, Room 351   Abstract. Quantum Sinkhorn’s theorem states that nonunital positive maps can be reduced to unital ones by using two auxiliary completely positive maps with Kraus rank 1, one of which is applied prior to the considered nonunital map and the other is applied after it. The explicit relation is found in the case of qubit maps. Basing on such a[…]

Algorithmic simulation of far-from-equilibrium dynamics using superconducting quantum computer

Posted on by

Walter Pogosov, Head of the Laboratory of Physics of Micro- and Nanostructures Dukhov Research Institute of Automatics (Rosatom State Corporation) 06 June 2018, 15:00-16:30 Skoltech, TPOC-4, Nobel str. 1, Red Building, 3rd floor, Room 351 Abstract. We point out that superconducting quantum computers are prospective for the simulation of the dynamics of spin models far from equilibrium, including nonadiabatic phenomena and quenches. The important advantage of these machines is that they are programmable, so that different spin models can be simulated in the same chip, as well as various initial states can be encoded into it in a controllable way. This opens an opportunity to use superconducting quantum computers in studies[…]

Schrödinger cats for a ‘quantum internet’ – Alex Lvovsky

Posted on by

Professor Alexander Lvovsky, Department of Physics and Astronomy, University of Calgary Group Lead, Quantum Optics Group, Russian Quantum Center Blue Building 303 (Multifunctional Zone)​, Skoltech Campus 29 May at 15:00     ABSTRACT: Superpositions of macroscopically distinct quantum states, introduced in Schrödinger’s famous Gedankenexperiment, are an epitome of quantum “strangeness” and a natural tool for determining the validity limits of quantum physics. The optical incarnation of Schrödinger’s cat – the superposition of two opposite-amplitude coherent states – is also the backbone of quantum information processing in the continuous-variable domain. The talk will cover recent experimental progress on preparing such states, applying them in quantum technology and communications, and increasing their[…]