Quantum-Circuit Design for Efficiently Simulating Many-Body Quantum Dynamics

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=j7ZdF8rjFUY


Duration: 54:07
2,283 views
53

We construct an efficient autonomous quantum-circuit design algorithm for creating efficient quantum circuits to simulate Hamiltonian many-body quantum dynamics for arbitrary input states. The resultant quantum circuits have a size that scales optimally with respect to space complexity and employ a sequence of gates that is close to optimal with respect to time complexity. We also present an algorithm that exploits commutativity to optimize the circuits for parallel execution. As examples, we show how to use our autonomous algorithm to construct circuits for simulating dynamics of Kitaev's honeycomb model and the Bardeen-Cooper-Schrieffer model of superconductivity.



Other Videos By Microsoft Research


2016-07-28Prototyping Windows Phone Applications
2016-07-28The Livehoods Project: Utilizing Social Media to Understand the Dynamics of a City
2016-07-28Infinite Reality: Avatars, Eternal Life, New Worlds, and the Dawn of the Virtual Revolution
2016-07-28mSDA: A fast and easy-to-use way to improve bag-of-words features
2016-07-28From Under-approximations to Over-approximations and Back
2016-07-28Intuitive proofs of Ergodic Theorems
2016-07-28Relax and Randomize: A recipe for online learning algorithms
2016-07-28Shared variables and data races in C++11
2016-07-28Large Linear Classification when Data Cannot Fit In Memory
2016-07-28Verifying the integrity of peripherals' firmware
2016-07-28Quantum-Circuit Design for Efficiently Simulating Many-Body Quantum Dynamics
2016-07-27New-media arts inside and outside the research laboratory
2016-07-27Facing Interaction
2016-07-27Efficient Market Making via Convex Optimization
2016-07-27Working Playfully to Learn: The Roles of Mediated Environments for Meaning-Making
2016-07-27Building Net Trust in the Homes of Seniors
2016-07-27Expositor: Scriptable Time-Travel Debugging with First Class Traces
2016-07-27Computational artists through a virtual lens: CLOUDS documentary and depth enabled
2016-07-27Approximating k-Median via Pseudo-Approximation
2016-07-27Handling Multitude of Nash Equilibria in Voting Games
2016-07-27Towards Verification of Behavioral Software Contracts


Tags:
microsoft research