Efficient Circuit-Based Quantum State Tomography via Sparse Entry Optimization

• URL: http://arxiv.org/abs/2407.20298v1
• Date: Mon, 29 Jul 2024 02:59:13 GMT
• Title: Efficient Circuit-Based Quantum State Tomography via Sparse Entry Optimization
• Authors: Chi-Kwong Li, Kevin Yipu Wu, Zherui Zhang,
• Abstract summary: We propose an efficient circuit-based quantum state tomography scheme to reconstruct $n$-qubit states with $k$ nonzero entries. We provide an upper limit on the number of CNOT gates based on the nonzero entries' positions in $|psirangle$.
• Score: 0.6008132390640295
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose an efficient circuit-based quantum state tomography (QST) scheme to reconstruct $n$-qubit states with $k$ nonzero entries using measurements of $|\psi\rangle$ and $U_1|\psi\rangle, \dots, U_{2m}|\psi\rangle$, where $m \le k$. Each $U_j$ involves CNOT gates followed by a single-qubit gate, either Hadamard $H$ or $HD$, where $D = {\rm diag}(1,i)$, targeting a specific qubit. We provide an upper limit on the number of CNOT gates based on the nonzero entries' positions in $|\psi\rangle$. This approach, applied to both state and process tomography, was tested using the Qiskit simulator.

Related papers

• Sandwich test for Quantum Phase Estimation [0.0]
  Quantum Phase Estimation (QPE) has potential for a scientific revolution through numerous practical applications.<n>Many QPE algorithms use the Hadamard test to estimate $langle psi|Uk|psirangle$ for a large integer $k$.<n>We present a new algorithm, the SANDWICH test to address this bottleneck.
  arXiv  Detail & Related papers  (2025-07-31T16:45:07Z)
• Depth-Efficient Quantum Circuit Synthesis for Deterministic Dicke State Preparation [5.755460769073285]
  Dicke states represent an important class of entangled quantum states with broad applications in quantum computing.<n>We propose deterministic quantum circuits for Dicke state preparation under two commonly seen qubit connectivity constraints.
  arXiv  Detail & Related papers  (2025-05-21T11:55:17Z)
• Towards Optimal Circuit Size for Sparse Quantum State Preparation [10.386753939552872]
  We consider the preparation for $n$-qubit sparse quantum states with $s$ non-zero amplitudes and propose two algorithms. The first algorithm uses $O(ns/log n + n)$ gates, improving upon previous methods by $O(log n)$. The second algorithm is tailored for binary strings that exhibit a short Hamiltonian path.
  arXiv  Detail & Related papers  (2024-04-08T02:13:40Z)
• Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
  We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
  arXiv  Detail & Related papers  (2024-02-23T12:22:03Z)
• Detection of Dense Subhypergraphs by Low-Degree Polynomials [72.4451045270967]
  Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem. We consider detecting the presence of a planted $Gr(ngamma, n-alpha)$ subhypergraph in a $Gr(n, n-beta) hypergraph. Our results are already new in the graph case $r=2$, as we consider the subtle log-density regime where hardness based on average-case reductions is not known.
  arXiv  Detail & Related papers  (2023-04-17T10:38:08Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Basic quantum subroutines: finding multiple marked elements and summing numbers [1.1265248232450553]
  We show how to find all $k$ marked elements in a list of size $N$ using the optimal number $O(sqrtN k)$ of quantum queries.
  arXiv  Detail & Related papers  (2023-02-20T19:11:44Z)
• Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning [54.806166861456035]
  We study the episodic reinforcement learning (RL) problem modeled by finite-horizon Markov Decision Processes (MDPs) with constraint on the number of batches. We design a computational efficient algorithm to achieve near-optimal regret of $tildeO(sqrtSAH3Kln (1/delta))$tildeO(cdot) hides logarithmic terms of $(S,A,H,K)$ in $K$ episodes. Our technical contribution are two-fold: 1) a near-optimal design scheme to explore
  arXiv  Detail & Related papers  (2022-10-15T09:22:22Z)
• Enlarging the notion of additivity of resource quantifiers [62.997667081978825]
  Given a quantum state $varrho$ and a quantifier $cal E(varrho), it is a hard task to determine $cal E(varrhootimes N)$. We show that the one shot distillable entanglement of certain spherically symmetric states can be quantitatively approximated by such an augmented additivity.
  arXiv  Detail & Related papers  (2022-07-31T00:23:10Z)
• Supervised Training of Conditional Monge Maps [107.78770597815242]
  Optimal transport (OT) theory describes general principles to define and select, among many possible choices, the most efficient way to map a probability measure onto another. We introduce CondOT, a multi-task approach to estimate a family of OT maps conditioned on a context variable. We demonstrate the ability of CondOT to infer the effect of an arbitrary combination of genetic or therapeutic perturbations on single cells.
  arXiv  Detail & Related papers  (2022-06-28T19:34:44Z)
• A Logarithm Depth Quantum Converter: From One-hot Encoding to Binary Encoding [6.461907578088013]
  We present a method converting between the one-hot encoding state and the binary encoding state by taking the Edick state as the transition state. Compared with the early work, our circuit achieves the exponential speedup with $O(log2 N)$ depth and $O(N)$ size.
  arXiv  Detail & Related papers  (2022-06-22T15:18:42Z)
• Divide-and-conquer verification method for noisy intermediate-scale quantum computation [0.0]
  noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip. We propose a method to efficiently verify such noisy intermediate-scale quantum computation.
  arXiv  Detail & Related papers  (2021-09-30T08:56:30Z)
• Unitarization Through Approximate Basis [0.0]
  Unitarization is the problem of taking $k$ input circuits that produce quantum states from the all $0$ state. We find an approximate basis in time for the following parameters.
  arXiv  Detail & Related papers  (2021-04-01T22:11:05Z)
• Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity [94.37110094442136]
  We study the problem of agnostic $Q$-learning with function approximation in deterministic systems. We show that if $delta = Oleft(rho/sqrtdim_Eright)$, then one can find the optimal policy using $Oleft(dim_Eright)$.
  arXiv  Detail & Related papers  (2020-02-17T18:41:49Z)
• Tight Quantum Lower Bound for Approximate Counting with Quantum States [49.6558487240078]
  We prove tight lower bounds for the following variant of the counting problem considered by Aaronson, Kothari, Kretschmer, and Thaler ( 2020) The task is to distinguish whether an input set $xsubseteq [n]$ has size either $k$ or $k'=(1+varepsilon)k$.
  arXiv  Detail & Related papers  (2020-02-17T10:53:50Z)

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.