Implementation of XY entangling gates with a single calibrated pulse
Novel implementation of XY(θ) unlocks a new family of entangling gates.
Read MoreThe latest in Quantum Thinking
Novel implementation of XY(θ) unlocks a new family of entangling gates.
Read MoreWe test the proposed method on Rigetti's quantum processor unit and find an excellent agreement with the theory, despite experimental errors.
Read MoreWe establish the tractability of finding the optimal Nash equilibrium to a discrete congestion game using a gate-model quantum computer.
Read MoreWe describe many of the principles behind Quilc's design, and demonstrate the compiler with various examples.
Read MoreWe introduce a new type of transformational layer called a quantum convolution, or quanvolutional layer.
Read MoreWe enumerate the architectural requirements of a quantum-classical cloud platform, and present a framework for benchmarking its runtime performance.
Read MoreWe investigate the feasibility of the assumption that a variety of tasks in quantum programming could be modeled as Markov Decision Processes by exploring its consequences for two of the simplest tasks in quantum programming: state preparation and gate compilation.
Read MoreWe present three measurements that directly quantify the DC and AC flux crosstalk present between tunable transmons.
Read MoreExperimental analysis demonstrates the potential tractability of this application on NISQ hardware.
Read MoreWe introduce an approximate description of an N--qubit state, which contains sufficient information to estimate the expectation value of any observable with precision.
Read MoreLow-pass filtering the AC signal used to drive two-qubit gates between the first and second harmonic frequencies can reduce qubit sensitivity to flux noise at the AC sweet spot.
Read MoreAgents trained through RL techniques are capable of producing short quantum programs with high quality solutions.
Read MoreDisplaying 49–60 of 73 results