True experimental reconstruction of quantum states and processes via convex optimization

• URL: http://arxiv.org/abs/2003.14011v1
• Date: Tue, 31 Mar 2020 08:02:59 GMT
• Title: True experimental reconstruction of quantum states and processes via convex optimization
• Authors: Akshay Gaikwad and Arvind and Kavita Dorai
• Abstract summary: We use a constrained convex optimization (CCO) method to experimentally characterize arbitrary quantum states and unknown quantum processes on a two-qubit NMR quantum information processor.
• Score: 4.291616110077346
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We use a constrained convex optimization (CCO) method to experimentally characterize arbitrary quantum states and unknown quantum processes on a two-qubit NMR quantum information processor. Standard protocols for quantum state and quantum process tomography are based on linear inversion, which often result in an unphysical density matrix and hence an invalid process matrix. The CCO method on the other hand, produces physically valid density matrices and process matrices, with significantly improved fidelity as compared to the standard methods. The constrainedoptimization problem is solved with the help of a semi-definite programming (SDP) protocol. We use the CCO method to estimate the Kraus operators and characterize gates in the presence of errors due to decoherence. We then assume Markovian system dynamics and use a Lindblad master equation in conjunction with the CCO method to completely characterize the noise processes present in the NMR qubits.

Related papers

• Fast quantum interconnects via constant-rate entanglement distillation [0.0]
  We develop constant-rate entanglement distillation methods for quantum interconnects. We prove the scheme has constant-rate in expectation and numerically optimize to achieve low practical overhead. We find our optimized schemes outperform existing computationally efficient quantum interconnect schemes by an order of magnitude in relevant regimes.
  arXiv  Detail & Related papers  (2024-08-28T16:54:54Z)
• Quantum Natural Stochastic Pairwise Coordinate Descent [6.187270874122921]
  Quantum machine learning through variational quantum algorithms (VQAs) has gained substantial attention in recent years. This paper introduces the quantum natural pairwise coordinate descent (2QNSCD) optimization method. We develop a highly sparse unbiased estimator of the novel metric tensor using a quantum circuit with gate complexity $Theta(1)$ times that of the parameterized quantum circuit and single-shot quantum measurements.
  arXiv  Detail & Related papers  (2024-07-18T18:57:29Z)
• Locally purified density operators for noisy quantum circuits [17.38734393793605]
  We show that mixed states generated from noisy quantum circuits can be efficiently represented by locally purified density operators (LPDOs) We present a mapping from LPDOs of $N$ qubits to projected entangled-pair states of size $2times N$ and introduce a unified method for managing virtual and Kraus bonds.
  arXiv  Detail & Related papers  (2023-12-05T16:10:30Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
  We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems. We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
  arXiv  Detail & Related papers  (2022-08-01T12:48:48Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Parameterized process characterization with reduced resource requirements [0.5735035463793008]
  This work proposes an alternative approach that requires significantly fewer resources for unitary process characterization without prior knowledge of the process. By measuring the quantum process as rotated through the X and Y axes on the Sphere Bloch, we can acquire enough information to reconstruct the quantum process matrix $chi$ and measure its fidelity. We demonstrate in numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.
  arXiv  Detail & Related papers  (2021-09-22T17:41:32Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Hybrid quantum variational algorithm for simulating open quantum systems with near-term devices [0.0]
  Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources. We develop an HQC algorithm using an efficient variational optimization approach to simulate open system dynamics.
  arXiv  Detail & Related papers  (2020-08-12T13:49:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.