DD

David P. Divincenzo

26 records found

During the last 30 years, stimulated by the quest to build superconducting quantum processors, a theory of quantum electrical circuits has emerged, which is called circuit quantum electrodynamics or circuit-QED. The goal of the theory is to provide a quantum description of the mo ...
We present a circuit design composed of two Josephson junctions coupled by a nonreciprocal element, the gyrator, whose ground space is doubly degenerate. The ground states are approximate code words of the Gottesman-Kitaev-Preskill code. We determine the low-energy dynamics of th ...
We consider how the Hamiltonian Quantum Computing scheme introduced in (2016 New J. Phys. 18 023042) can be implemented using a 2D array of superconducting transmon qubits. We show how the scheme requires the engineering of strong attractive cross-Kerr and weak flip-flop or hoppi ...
We present superconducting microwave-frequency resonators based on NbTiN nanowires. The small cross section of the nanowires minimizes vortex generation, making the resonators resilient to magnetic fields. Measured intrinsic quality factors exceed 2×105 in a 6-T in-plane magnetic ...
We perform a detailed analysis of how an amplified interferometer can be used to enhance the quality of a dispersive qubit measurement, such as one performed on a superconducting transmon qubit, using homodyne detection on an amplified microwave signal. Our modeling makes a reali ...
We consider a system consisting of a 2D network of links between Majorana fermions on superconducting islands. We show that the fermionic Hamiltonian modeling this system is topologically ordered in a region of parameter space: we show that Kitaev's toric code emerges in fourth-o ...
We present a universal scheme of pulsed operations suitable for theIBM oscillator-stabilized flux qubit comprising the controlled-σz(cphase) gate,single-qubit preparations and measurements. Based on numerical simulations,we argue that the error rates for these operations can be a ...
We study a comprehensive list of quantum codes as candidates for codes used at the physical level in a fault-tolerant code architecture. Using the Aliferis-Gottesman-Preskill (AGP) ex-Rec method we calculate the pseudo-threshold for these codes against depolarizing noise at vario ...
We study the complexity of the Local Hamiltonian Problem (denoted as LH-MIN) in the special case when a Hamiltonian obeys the condition that all off-diagonal matrix elements in the standard basis are real and non-positive. We will call such Hamiltonians, which are common in the n ...
We show how to map a given n-qubit target Hamiltonian with bounded-strength k-body interactions onto a simulator Hamiltonian with two-body interactions, such that the ground-state energy of the target and the simulator Hamiltonians are the same up to an extensive error O(n) for a ...
We consider a model of quantum computation in which the set of operations is limited to nearest-neighbor interactions on a 2D lattice. We model movement of qubits with noisy SWAP operations. For this architecture we design a fault-tolerant coding scheme using the concatenated [[7 ...
We provide an alternative view of the efficient classical simulatibility of fermionic linear optics in terms of Slater determinants. We investigate the generic effects of two-mode measurements on the Slater number of fermionic states. We argue that most such measurements are not ...
We analyze and study the effects of locality on the fault-tolerance threshold for quantum computation. We analytically estimate how the threshold will depend on a scale parameter which characterizes the scale-up in the size of the circuit due to encoding. We carry out a detailed ...
Security trade-offs have previously been established for one-way bit commitment. We study this trade-off in two superselection settings. We show that for an 'abelian' superselection rule (exemplified by particle conservation), the standard trade-off between sealing and binding pr ...
We show that there exist bipartite quantum states which contain a large locked classical correlation that is unlocked by a disproportionately small amount of classical communication. In particular, there are [Formula presented]-qubit states for which a one-bit message doubles the ...
We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM.@en
Recent work has shown how to use the laws of quantum mechanics to keep classical and quantum bits secret in a number of different circumstances. Among the examples are private quantum channels, quantum secret sharing and quantum data hiding. In this paper we show that a method fo ...
We report new results and generalizations of our work on unextendible product bases (UPB), uncompletable product bases and bound entanglement. We present a new construction for bound entangled states based on product bases which are only completable in a locally extended Hilbert ...
We expand on our work on Quantum Data Hiding - hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper ...
We introduce a measure of both quantum as well as classical correlations in a quantum state, the entanglement of purification. We show that the (regularized) entanglement of purification is equal to the entanglement cost of creating a state ρ asymptotically from maximally entangl ...