Quantum gate characterization in an extended Hilbert space

We describe an approach for characterizing the process of quantum gates using quantum process tomography, by first modeling them in an extended Hilbert space, which includes non-qubit degrees of freedom. To prevent unphysical processes from being predicted, present quantum process tomography procedures incorporate mathematical constraints, which make no assumptions as to the actual physical nature of the system being described. By contrast, the procedure presented here ensures physicality by placing physical constraints on the nature of quantum processes. This allows quantum process tomography to be performed using a smaller experimental data set, and produces parameters with a direct physical interpretation. The approach is demonstrated by example of mode-matching in an all-optical controlled-NOT gate. The techniques described are non-specific and could be applied to other optical circuits or quantum computing architectures.Comment: 4 pages, 2 figures, REVTeX (published version

Calibration and High Fidelity Measurement of a Quantum Photonic Chip

Integrated quantum photonic circuits are becoming increasingly complex. Accurate calibration of device parameters and detailed characterization of the prepared quantum states are critically important for future progress. Here we report on an effective experimental calibration method based on Bayesian updating and Markov chain Monte Carlo integration. We use this calibration technique to characterize a two qubit chip and extract the reflectivities of its directional couplers. An average quantum state tomography fidelity of 93.79+/-1.05% against the four Bell states is achieved. Furthermore, comparing the measured density matrices against a model using the non-ideal device parameters derived from the calibration we achieve an average fidelity of 97.57+/-0.96%. This pinpoints non-ideality of chip parameters as a major factor in the decrease of Bell state fidelity. We also perform quantum state tomography for Bell states while continuously varying photon distinguishability and find excellent agreement with theory

Tractable Simulation of Error Correction with Honest Approximations to Realistic Fault Models

In previous work, we proposed a method for leveraging efficient classical simulation algorithms to aid in the analysis of large-scale fault tolerant circuits implemented on hypothetical quantum information processors. Here, we extend those results by numerically studying the efficacy of this proposal as a tool for understanding the performance of an error-correction gadget implemented with fault models derived from physical simulations. Our approach is to approximate the arbitrary error maps that arise from realistic physical models with errors that are amenable to a particular classical simulation algorithm in an "honest" way; that is, such that we do not underestimate the faults introduced by our physical models. In all cases, our approximations provide an "honest representation" of the performance of the circuit composed of the original errors. This numerical evidence supports the use of our method as a way to understand the feasibility of an implementation of quantum information processing given a characterization of the underlying physical processes in experimentally accessible examples.Comment: 34 pages, 9 tables, 4 figure

Non-Markovian memory in IBMQX4

We measure and quantify non-Markovian effects in IBM's Quantum Experience. Specifically, we analyze the temporal correlations in a sequence of gates by characterizing the performance of a gate conditioned on the gate that preceded it. With this method, we estimate (i) the size of fluctuations in the performance of a gate, i.e., errors due to non-Markovianity; (ii) the length of the memory; and (iii) the total size of the memory. Our results strongly indicate the presence of non-trivial non-Markovian effects in almost all gates in the universal set. However, based on our findings, we discuss the potential for cleaner computation by adequately accounting the non-Markovian nature of the machine.Comment: 8 page

Circuit QED with a Nonlinear Resonator : ac-Stark Shift and Dephasing

We have performed spectroscopic measurements of a superconducting qubit dispersively coupled to a nonlinear resonator driven by a pump microwave field. Measurements of the qubit frequency shift provide a sensitive probe of the intracavity field, yielding a precise characterization of the resonator nonlinearity. The qubit linewidth has a complex dependence on the pump frequency and amplitude, which is correlated with the gain of the nonlinear resonator operated as a small-signal amplifier. The corresponding dephasing rate is found to be close to the quantum limit in the low-gain limit of the amplifier.Comment: Paper : 4 pages, 3 figures; Supplementary material : 1 page, 1 figur

Two-message quantum interactive proofs and the quantum separability problem

Suppose that a polynomial-time mixed-state quantum circuit, described as a sequence of local unitary interactions followed by a partial trace, generates a quantum state shared between two parties. One might then wonder, does this quantum circuit produce a state that is separable or entangled? Here, we give evidence that it is computationally hard to decide the answer to this question, even if one has access to the power of quantum computation. We begin by exhibiting a two-message quantum interactive proof system that can decide the answer to a promise version of the question. We then prove that the promise problem is hard for the class of promise problems with "quantum statistical zero knowledge" (QSZK) proof systems by demonstrating a polynomial-time Karp reduction from the QSZK-complete promise problem "quantum state distinguishability" to our quantum separability problem. By exploiting Knill's efficient encoding of a matrix description of a state into a description of a circuit to generate the state, we can show that our promise problem is NP-hard with respect to Cook reductions. Thus, the quantum separability problem (as phrased above) constitutes the first nontrivial promise problem decidable by a two-message quantum interactive proof system while being hard for both NP and QSZK. We also consider a variant of the problem, in which a given polynomial-time mixed-state quantum circuit accepts a quantum state as input, and the question is to decide if there is an input to this circuit which makes its output separable across some bipartite cut. We prove that this problem is a complete promise problem for the class QIP of problems decidable by quantum interactive proof systems. Finally, we show that a two-message quantum interactive proof system can also decide a multipartite generalization of the quantum separability problem.Comment: 34 pages, 6 figures; v2: technical improvements and new result for the multipartite quantum separability problem; v3: minor changes to address referee comments, accepted for presentation at the 2013 IEEE Conference on Computational Complexity; v4: changed problem names; v5: updated references and added a paragraph to the conclusion to connect with prior work on separability testin