<caption><image_0>The image is a title slide for a presentation on Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth. The slide has a pink background with white text. The title of the presentation is written in large, bold font at the top of the slide. Below the title, there is a subtitle that reads "Joel Rajkumar, James Watson, Y-Kai Liu, arkv. 2403.14607". At the bottom, there are logos for the Joint Center for Quantum Information and Computer Science, NIST, and the Department of Computer Science.</caption><transcript><audio_1>okay we'll have our next talk now it's going to be by Joel rajakumar and he's going to be telling us about Pol polinomial time simulation of noisy iqp circuits okay um hi everyone I'm excited to be here um I'm going to be talking</transcript><transcript><audio_2>about polinomial time classical simulation of noisy iqp circuits with constant de uh this is Joint work with James Watson and yyo over at the University of Maryland um so a lot of what motivates this work is Quantum Supremacy</transcript><caption><image_3>The image is a slide from a presentation on Quantum Supremacy Experiments. The slide has a white background with a pink border. On the top right corner, there is a logo of a computer monitor with the word "Zoom" written on it. Below the logo, there are two bullet points that read "Expected to be difficult for a classical computer to solve". The text is written in black font and is centered on the slide.</caption><transcript><audio_4>experiments so you probably heard of these before um they're usually tasks that are expected to be difficult for a classical computer to solve and at the same time tractable for a near-term quantum computer and some examples of</transcript><transcript><audio_5>these are random Quantum circuits which were implemented some time ago by the Google group um iqp circuits more recently implemented by this Harvard QA UMD collaboration and Bon sampling which is also implemented on hardare Hardware</transcript><transcript><audio_6>recently and there's another hope with these experiments is that they're also efficiently verifiable as well but I won't be talking too much about that part of it what I'm going to be focusing on in this talk are the first two bullet points are these tasks difficult for a</transcript><transcript><audio_7>classical computer to solve and are they tractable on a near-term quantum computer so um if you haven't guessed I'm going to be focusing on iqp circuits and what's an iqp circuit well I start with every cubit in the plus state so I have an equal superposition of every</transcript><transcript><audio_8>single computational basis state and then I apply a diagonal unary this is diagonal in the computational basis and this unitary is usually constructed with discrete gate sets so for example T controlled phase uh zcz ccz these are</transcript> okay we'll have our next talk now it's going to be by Joel rajakumar and he's going to be telling us about Pol polinomial time simulation of noisy iqp circuits okay um hi everyone I'm excited to be here um I'm going to be talking about polinomial time classical simulation of noisy iqp circuits with constant de uh this is Joint work with James Watson and yyo over at the University of Maryland um so a lot of what motivates this work is Quantum Supremacy experiments so you probably heard of these before um they're usually tasks that are expected to be difficult for a classical computer to solve and at the same time tractable for a near-term quantum computer and some examples of these are random Quantum circuits which were implemented some time ago by the Google group um iqp circuits more recently implemented by this Harvard QA UMD collaboration and Bon sampling which is also implemented on hardare Hardware recently and there's another hope with these experiments is that they're also efficiently verifiable as well but I won't be talking too much about that part of it what I'm going to be focusing on in this talk are the first two bullet points are these tasks difficult for a classical computer to solve and are they tractable on a near-term quantum computer so um if you haven't guessed I'm going to be focusing on iqp circuits and what's an iqp circuit well I start with every cubit in the plus state so I have an equal superposition of every single computational basis state and then I apply a diagonal unary this is diagonal in the computational basis and this unitary is usually constructed with discrete gate sets so for example T controlled phase uh zcz ccz these are
{"source": "grass-yt-cc-by.1H5TegqRyJg|shard_10010_16|create_multimodal_data.extract_yt_and_generate_transcripts.42|shard_10010|create_multimodal_data.generate_captions.42|shard_10010|create_multimodal_data.generate_captions.42", "params": {"id": "1H5TegqRyJg", "channel_id": "UC-_JZ93_gA5QL5mrmvdZ0-Q", "duration": 1467, "view_count": 57, "age_limit": 0, "like_count": 1, "channel_follower_count": 1230, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@SquidSchools", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_10010/1H5TegqRyJg.tar.gz"}}