We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We have enhanced our methodology over previous implementations of csQPT by leveraging Kraus operators and constrained gradient descent to learn the underlying process. We show the results of our method by characterizing a logical quantum gate implemented using displacement and selective number-dependent arbitrary phase operations on an encoded qubit. Our use of csQPT allows for the reconstruction of Kraus operators for the larger Hilbert space rather than being limited to the logical subspace. This approach enables us to more accurately identify and quantify the various error mechanisms that can lead to gate infidelity, including those occurring outside of the computational subspace. We showcase the potential of our approach by demonstrating the ability to quantify leakage outside of the computational subspace, a key factor for developing more robust and reliable quantum gates in high-dimensional systems. Published by the American Physical Society 2024
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We have enhanced our methodology over previous implementations of csQPT by leveraging Kraus operators and constrained gradient descent to learn the underlying process. We show the results of our method by characterizing a logical quantum gate implemented using displacement and selective number-dependent arbitrary phase operations on an encoded qubit. Our use of csQPT allows for the reconstruction of Kraus operators for the larger Hilbert space rather than being limited to the logical subspace. This approach enables us to more accurately identify and quantify the various error mechanisms that can lead to gate infidelity, including those occurring outside of the computational subspace. We showcase the potential of our approach by demonstrating the ability to quantify leakage outside of the computational subspace, a key factor for developing more robust and reliable quantum gates in high-dimensional systems. Published by the American Physical Society 2024
We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems by learning a process representation using Kraus operators. The Kraus form ensures that the reconstructed process is completely positive. To make the process trace preserving, we use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. Our ansatz uses a few Kraus operators to avoid direct estimation of large process matrices, e.g., the Choi matrix, for low-rank quantum processes. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes, but shines by combining the best features of these two methods. Similar to CS (but unlike PLS), GD-QPT can reconstruct a process from just a small number of random measurements, and similar to PLS (but unlike CS) it also works for larger system sizes, up to at least five qubits. We envisage that the data-driven approach of GD-QPT can become a practical tool that greatly reduces the cost and computational effort for QPT in intermediate-scale quantum systems.
Coherent-state quantum process tomography (csQPT) is a method for completely characterizing a quantum-optical ‘black box’ by probing it with coherent states and carrying out homodyne measurements on the output (Lobino et al 2008 Science 322 563). We present a technique for csQPT that is fully based on statistical inference, in particular, quantum expectation-maximization. The method relies on the Jamiolkowski isomorphism and iteratively reconstructs the process tensor in the Fock basis directly from the experimental data. This approach permits incorporation of a priori constraints into the reconstruction procedure, thereby guaranteeing that the resulting process tensor is physically consistent. Furthermore, our method is easier to implement and requires a narrower range of coherent states than its predecessors. We test its feasibility using simulations on several experimentally relevant processes.
Coherent-state quantum process tomography (csQPT) is a method of completely characterizing a quantum-optical "black box" by probing it with coherent states and performing homodyne measurements on the output [M. Lobino et al, Science 322, 563 (2008)]. We present a technique for csQPT that is fully based on statistical inference, specifically, quantum expectation-maximization. The method relies on the Jamiolkowski isomorphism and iteratively reconstructs the process tensor in the Fock basis directly from the experimental data. This approach permits incorporation of a priori constraints into the reconstruction procedure, thereby guaranteeing that the resulting process tensor is physically consistent. Furthermore, our method is easier to implement and requires a narrower range of coherent states than its predecessors. We test its feasibility using simulations on several experimentally relevant processes.
The Berkeley gate is a high-performance, two-qubit entangling operation with particular potential for quantum error correction and fault-tolerant protocols. However, harnessing this potential on current noisy intermediate-scale quantum (NISQ) processors, requires efficient compilation and robust performance under realistic noise conditions. In this work, we demonstrate a hardware-efficient implementation of the Berkeley gate on a superconducting quantum processor. Using quantum process tomography (QPT), we experimentally characterize its performance and benchmark it against a noiseless quantum simulator to evaluate its practical reliability in the NISQ era. Experimental measurements confirm the gate's correct logical action, producing the target partially entangled state with a subspace confinement probability of [Formula: see text] on real quantum hardware compared to 100% in quantum simulation. Results from QPT experiments show a simulated process fidelity of [Formula: see text], while the experimental process fidelity on hardware is [Formula: see text]. The observed discrepancy is analyzed in the context of device-specific noise sources, including qubit relaxation, dephasing, and state preparation and measurement (SPAM) errors. Our work provides a concrete fidelity benchmark for the Berkeley gate on superconducting hardware and quantify the impact of realistic noise on a non-trivial two-qubit operation, supporting its use in near-term algorithmic and error-correction applications.
Quantum process tomography is a powerful tool for understanding quantum channels and characterizing the properties of quantum devices. Inspired by recent advances using classical shadows in quantum state tomography [H.-Y. Huang, R. Kueng, and J. Preskill, .], we have developed ShadowQPT, a classical shadow method for quantum process tomography. We introduce two related formulations with and without ancilla qubits. ShadowQPT stochastically reconstructs the Choi matrix of the device allowing for an classical evaluation of the device on arbitrary inputs with respect to arbitrary outputs. Using shadows, we then show how to compute overlaps, generate all k -weight reduced processes, and perform reconstruction via Hamiltonian learning. These latter two tasks are efficient for large systems as the number of quantum measurements needed scales only logarithmically with the number of qubits. A number of additional approximations and improvements are developed, including the use of a pair-factorized Clifford shadow and a series of postprocessing techniques that significantly enhance the accuracy for recovering the quantum channel. We have implemented ShadowQPT using both Pauli and Clifford measurements on the IonQ trapped ion quantum computer for quantum processes up to n=4 qubits, and we achieved good performance. Published by the American Physical Society 2024
Quantum computing holds the promise of solving problems that are intractable for classical computers, with applications ranging from optimization and materials simulation to cryptography. It achieves this by leveraging the exponentially scaling dimensionality of the space encoding quantum information and by executing algorithms on quantum registers in superposition states – a feature often referred to as quantum parallelism. However, while encoding information in computational units capable of exploring a continuous set of quantum states enables exponential scaling of computational power with system size, quantum systems are also more susceptible to errors than their classical counterparts. These errors take the form of both control errors, where miscalibration of the control pulses causes coherent errors on the qubit states, as well as incoherent errors due to energy relaxation and dephasing. Scaling quantum systems to run useful algorithms involving hundreds or thousands of logical qubits will require quantum error correction. In this approach, quantum information is redundantly encoded across an entangled state of many physical qubits. This has enabled experimental demonstrations across various platforms – including ion traps, superconducting circuits, and neutral atoms – showing that encoded quantum states can be preserved beyond the coherence times of the constituting physical qubits. However, quantum state preservation is only one component needed for scalable quantum computing. To execute algorithms, it is also necessary to implement quantum gates on and between encoded qubits, in a way that maintains fault tolerance by preserving the ability to correct errors as they occur during the computation. In the first part of this thesis, we demonstrate the implementation of an error-corrected quantum operation that entangles two logical qubits. This is achieved by performing lattice surgery on a distance-three surface code qubit, resulting in a logical Bell state encoded in distance-three repetition codes, which enable the correction of single bit-flip errors. We further introduce techniques to benchmark and characterize the performance of logical operations, including applying the protocol to arbitrary logical input states and performing logical quantum process tomography. Together, these results constitute one of the first realizations of error-corrected lattice surgery in superconducting circuits. While quantum error correction can correct errors provided they occur with sufficiently low frequency, it may fail when many qubits experience errors simultaneously. In the second part of this thesis, we therefore shift focus to a specific error mechanism known to cause correlated errors in superconducting circuits – quasiparticle-induced decoherence. In this case, various forms of energy deposition on the quantum device can break Cooper pairs into quasiparticles, which may subsequently diffuse to the tunnel junction and interact with the qubit state, thereby causing decoherence. In this thesis, we investigate the impact of quasiparticle tunneling on qubit performance, with a focus on infrared-induced quasiparticles. We compare the sensitivity of niobium-based qubits to those made from tantalum – a material that has gained interest in recent years following demonstrations of qubits with improved coherence times based on this material. Using a thermal radiator source, we show that the performance of tantalum qubits may be limited by infrared-induced quasiparticles in typical superconducting circuit experimental setups. By employing both ambient and in-line infrared filters, we investigate the effectiveness of different filtering strategies and develop best practices for engineering cryogenic environments for superconducting quantum processors. The results presented in this thesis contribute to the advancement of quantum computing based on superconducting circuits by implementing and characterizing quantum error-corrected operations, and by investigating quasiparticles as a source of decoherence, along with strategies to improve infrared filtering and signal conditioning in cryogenic environments for future fault-tolerant quantum computing.