Quick Navigation
Topics
Trapped Ion Quantum Computing
Efficient state estimation on quantum processors
arXiv
Authors: Victor Gonzalez Avella, Abraham Vega Vargas, Tomas Merlo Vergara, Kevin de la Ossa Doria, Jakub Czartowski, Dougal Main, Gabriel Araneda, Aldo Delgado, Dardo Goyeneche
Year
2025
Paper ID
51064
Status
Preprint
Abstract Read
~2 min
Abstract Words
163
Citations
N/A
Abstract
We present two scalable and entanglement-free methods for estimating the collective state of an n-qubit quantum computer. The first method consists of a fixed set of five quantum circuits-regardless of the number of qubits-that avoid the use of entanglement as a measurement resource, relying instead on classical communication between selected pairs of qubits. The second method requires only 2n+1 circuits, each of which applies a single local gate to one of the n qubits during the measurement stage. Unlike traditional estimation methods, our approaches do not require any costly post-processing procedure to estimate a quantum state, enabling scalability to relatively large system sizes. We experimentally compare both methods on freely available IBM quantum processors, and observe how the state estimation varies with increasing number of qubits and shots. We further validated our results by estimating the 4-qubit entangled state of two remote ion-trap quantum processors, demonstrating that the optimized 2n+1 tomographic scheme achieves estimates consistent with standard methods while using exponentially fewer measurements.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- We present two scalable and entanglement-free methods for estimating the collective state of an n-qubit quantum computer.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.