Falk Unger, University of California, Berkeley
Todd Pittman, University of Maryland, Baltimore County
Britton Plourde, Syracuse University
Nathan Wiebe, University of Calgary
We introduce an efficient quantum algorithm for simulating time-dependent Hamiltonian quantum dynamics on a quantum computer and accounts fully for all computational resources, especially the per-qubit oracle query cost, which has been previously regarded as constant cost per query regardless of the number of qubits accessed.
Adrian Lupascu, Institute for Quantum Computing
Quantum superconducting circuits are nanostructured superconducting electrical networks with Josephson junctions. At low temperatures, their quantum dynamics is properly described by using a few degrees of freedom with a collective character. The parameters in the Hamiltonian depend on the dimensions and topology of the circuit; superconducting quantum circuits therefore behave as artificial atoms.
Pranab Sen, Tata Institute of Fundamental Research
Ivan Deutsch, University of New Mexico
Alessandro Fedrizzi, Queensland University
Institute for Quantum Computing (IQC) members only golf tournament
Scramble rules.
In a scramble each player tees off on each hole. The best of the tee shots is selected and all players play their second shots from that spot. The best of the second shots is determined, then all play their third shots from that spot, and so on until the ball is holed. We will play in team of 4 and you need to use a shot from each player on your team.
For cross-fertilization between communities working on superconducting systems and electron spins