Partial and complete qubit estimation using a single observable: optimization and quantum simulation

• URL: http://arxiv.org/abs/2301.11121v1
• Date: Thu, 26 Jan 2023 14:19:24 GMT
• Title: Partial and complete qubit estimation using a single observable: optimization and quantum simulation
• Authors: Cristian A. Galvis Florez, J. Mart\'inez-Cifuentes, K. M. Fonseca-Romero
• Abstract summary: We evaluate two families of unitary evolution operators for quantum state estimation. We find that the minimum qTTF for the one- parameter model is achieved when the entangling power of the corresponding unitary operator is at its maximum. We propose a new scalable circuit design that improves qubit state tomography when run on an IBM quantum processing unit.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum state estimation is an important task of many quantum information protocols. We consider two families of unitary evolution operators, one with a one-parameter and the other with a two-parameter, which enable the estimation of a single spin component and all spin components, respectively, of a two-level quantum system. To evaluate the tomographic performance, we use the quantum tomographic transfer function (qTTF), which is calculated as the average over all pure states of the trace of the inverse of the Fisher information matrix. Our goal is to optimize the qTTF for both estimation models. We find that the minimum qTTF for the one-parameter model is achieved when the entangling power of the corresponding unitary operator is at its maximum. The models were implemented on an IBM quantum processing unit, and while the estimation of a single-spin component was successful, the whole spin estimation displayed relatively large errors due to the depth of the associated circuit. To address this issue, we propose a new scalable circuit design that improves qubit state tomography when run on an IBM quantum processing unit.

Related papers

• Scalable Parity Architecture With a Shuttling-Based Spin Qubit Processor [0.32985979395737786]
  We present sequences of spin shuttling and quantum gates that implement the Parity Quantum Approximate Optimization Algorithm (QAOA) We develop a detailed error model for a hardware-specific analysis of the Parity Architecture. We find that with high-fidelity spin shuttling the performance of the spin qubits is competitive or even exceeds the results of the transmons.
  arXiv  Detail & Related papers  (2024-03-14T17:06:50Z)
• A two-stage solution to quantum process tomography: error analysis and optimal design [6.648667887733229]
  We propose a two-stage solution for both trace-preserving and non-trace-preserving quantum process tomography. Our algorithm exhibits a computational complexity of $O(MLd2)$ where $d$ is the dimension of the quantum system. Numerical examples and testing on IBM quantum devices are presented to demonstrate the performance and efficiency of our algorithm.
  arXiv  Detail & Related papers  (2024-02-14T05:45:11Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver [17.975555487972166]
  Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages. The roadblock to developing quantum algorithms with the measurement-based quantum computation scheme is resource cost. We propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA)
  arXiv  Detail & Related papers  (2023-07-19T08:07:53Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• An Amplitude-Based Implementation of the Unit Step Function on a Quantum Computer [0.0]
  We introduce an amplitude-based implementation for approximating non-linearity in the form of the unit step function on a quantum computer. We describe two distinct circuit types which receive their input either directly from a classical computer, or as a quantum state when embedded in a more advanced quantum algorithm.
  arXiv  Detail & Related papers  (2022-06-07T07:14:12Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Post-Training Quantization for Vision Transformer [85.57953732941101]
  We present an effective post-training quantization algorithm for reducing the memory storage and computational costs of vision transformers. We can obtain an 81.29% top-1 accuracy using DeiT-B model on ImageNet dataset with about 8-bit quantization.
  arXiv  Detail & Related papers  (2021-06-27T06:27:22Z)

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.