activity
20002026
most citedUnimodular relativity and cosmological constant

103 citations · 498 across the 35 of their papers we have counts for

collaborators
Showing quant-phShow all

19 papers · 1 filter

quant-ph2018★ 2 cited

Quantum Zeno effect: A possible resolution to the leakage problem in superconducting quantum computing architectures

Andrei Galiautdinov

We propose to use the continuous version of the quantum Zeno effect to eliminate leakage to higher energy states in superconducting quantum computing architectures based on Josephs…

quant-ph2017

Lamb's reconstruction of potentials and spatially localized scattering in nonrelativistic quantum mechanics

Andrei Galiautdinov

We formulate a simple condition for reconstructibility of a certain class of Hamiltonians with real potentials from the knowledge of their complex-valued eigenfunctions. This may b…

quant-ph2015

Universal quantum simulation with prethreshold superconducting qubits: Single-excitation subspace method

Michael R. Geller, John M. Martinis, Andrew T. Sornborger +4

Current quantum computing architectures lack the size and fidelity required for universal fault-tolerant operation, limiting the practical implementation of key quantum algorithms…

quant-ph2013★ 30 cited

Catch-Disperse-Release Readout for Superconducting Qubits

Eyob A. Sete, Andrei Galiautdinov, Eric Mlinar +2

We analyze a single-shot readout for superconducting qubits via the controlled catch, dispersion, and release of a microwave field. A tunable coupler is used to decouple the microw…

quant-ph2013★ 88 cited

High-fidelity CZ gate for resonator-based superconducting quantum computers

Joydip Ghosh, Andrei Galiautdinov, Zhongyuan Zhou +3

A possible building block for a scalable quantum computer has recently been demonstrated [M. Mariantoni et al., Science 334, 61 (2011)]. This architecture consists of superconducti…

quant-ph2012

Universal quantum simulation with pre-threshold superconducting qubits: Single-excitation subspace method

Michael R. Geller, John M. Martinis, Andrew T. Sornborger +3

We propose a method for general-purpose quantum computation and simulation that is well suited for today's pre-threshold-fidelity superconducting qubits. This approach makes use of…

quant-ph2012

Simple protocol for generating W states in resonator-based quantum computing architectures

Andrei Galiautdinov

We describe a simple, practical scheme for generating multi-qubit W states in resonator-based architectures, in which N Josephson phase qubits are capacitively coupled to a common…

quant-ph2011★ 49 cited

Resonator/zero-Qubit architecture for superconducting qubits

Andrei Galiautdinov, Alexander N. Korotkov, John M. Martinis

We analyze the performance of the Resonator/zero-Qubit (RezQu) architecture in which the qubits are complemented with memory resonators and coupled via a resonator bus. Separating…

quant-ph2011★ 1 cited

Single-step implementation of the controlled-Z gate in a qubit/bus/qubit device

Andrei Galiautdinov

We propose a simple scheme for generating a high-fidelity controlled-Z (CZ) gate in a three-component qubit/bus/qubit device. The corresponding tune/detune pulse is single-step, wi…

quant-ph2011

Quantum computation with prethreshold superconducting qubits: Single-excitation subspace approach

Andrei Galiautdinov, Michael R. Geller

We describe an alternative approach to quantum computation that is ideally suited for today's sub-threshold-fidelity qubits, and which can be applied to a family of hardware models…

quant-ph2010★ 8 cited

Quantum Simulation of Molecular Collisions with Superconducting Qubits

Emily J. Pritchett, Colin Benjamin, Andrei Galiautdinov +4

We introduce a protocol for the fast simulation of -dimensional quantum systems on -qubit quantum computers with tunable couplings. A mapping is given between the control par…

quant-ph2009★ 12 cited

Greenberger-Horne-Zeilinger state protocols for fully connected qubit networks

Andrei Galiautdinov, Mark W. Coffey, Ron Deiotte

We generalize the recently proposed Greenberger-Horne-Zeilinger (GHZ) tripartite protocol [A. Galiautdinov, J. M. Martinis, Phys. Rev. A 78, 010305(R) (2008)] to fully connected ne…

quant-ph2009★ 23 cited

Quantum logic with weakly coupled qubits

Michael R. Geller, Emily J. Pritchett, Andrei Galiautdinov +1

There are well-known protocols for performing CNOT quantum logic with qubits coupled by particular high-symmetry (Ising or Heisenberg) interactions. However, many architectures bei…

quant-ph2009

Interaction-assisted SU(2) adiabatic holonomies in Josephson phase qubits

Andrei Galiautdinov

We propose a scheme for generating SU(2) adiabatic geometric phases in a circuit consisting of three capacitively coupled flux-biased Josephson phase qubits.

quant-ph2008★ 8 cited

Controlled-NOT logic with nonresonant Josephson phase qubits

Andrei Galiautdinov

We establish theoretical bounds on qubit detuning for high fidelity controlled-NOT logic gate implementations with weakly coupled Josephson phase qubits. It is found that the value…

quant-ph2008★ 32 cited

Maximally entangling tripartite protocols for Josephson phase qubits

Andrei Galiautdinov, John M. Martinis

We introduce a suit of simple entangling protocols for generating tripartite GHZ and W states in systems with anisotropic exchange interaction g(XX+YY)+g'ZZ. An interesting example…

quant-ph2007★ 7 cited

Single-step controlled-NOT logic from any exchange interaction

Andrei Galiautdinov

A self-contained approach to studying the unitary evolution of coupled qubits is introduced, capable of addressing a variety of physical systems described by exchange Hamiltonians…

quant-ph2007★ 1 cited

Controlled-NOT gate design for Josephson phase qubits with tunable inductive coupling: Weyl chamber steering and area theorem

Andrei Galiautdinov, Michael Geller

Superconducting qubits with tunable coupling are ideally suited for fast and accurate implementation of quantum logic. Here we present a simple approach, based on Weyl chamber stee…

quant-ph2004★ 4 cited

Elementary Operations

James Baugh, Andrei Galiautdinov, David Ritz Finkelstein +2

A Clifford algebra over the binary field 2 = {0,1} is a second-order classical logic that is substantially richer than Boolean algebra. We use it as a bridge to a Clifford algebrai…