2019
DOI: 10.1007/s11433-019-9366-7
|View full text |Cite
|
Sign up to set email alerts
|

Preparation of pseudo-pure states for NMR quantum computing with one ancillary qubit

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 46 publications
0
7
0
Order By: Relevance
“…Such special quantum states have interesting properties and have recently found several applications in the area of quantum information processing [41]. While standard schemes for pseudopure state preparation involve a large number of experiments and lead to reduced signal, recently a few schemes have been proposed that use only one ancilla spin and fewer number of experiments [52,53]. The relaxation behavior of twospin pseudopure states have been investigated and it was noted that cross-correlated spin relaxation plays an important role in accelerating or retarding the lifetimes of such states [54].…”
Section: B State Initialization Schemesmentioning
confidence: 99%
“…Such special quantum states have interesting properties and have recently found several applications in the area of quantum information processing [41]. While standard schemes for pseudopure state preparation involve a large number of experiments and lead to reduced signal, recently a few schemes have been proposed that use only one ancilla spin and fewer number of experiments [52,53]. The relaxation behavior of twospin pseudopure states have been investigated and it was noted that cross-correlated spin relaxation plays an important role in accelerating or retarding the lifetimes of such states [54].…”
Section: B State Initialization Schemesmentioning
confidence: 99%
“…Quantum computers can effectively simulate the dynamics of quantum systems [1][2][3], prepare quantum states [4,5] and solve machine learning tasks [6][7][8][9][10][11][12], although the related algorithms generally require deep gate sequences. In the past years, rapid advances in the construction of large-scale faulttolerate universal quantum computers have been made based on, for instance, superconducting qubits [13][14][15], photos [16], silicon quantum dots [17] and ultracold trapped ions [18,19].…”
Section: Introductionmentioning
confidence: 99%
“…Example applications of quantum computers include factorization, 3 database search, 4,5 solving linear equations, 6,7 query‐based eigensolver, 8 and full quantum eigensolver 9 . Proof‐of‐principle experiments of these quantum algorithms have been demonstrated on different physical platforms, such as optical system, 10‐13 ion‐trap system, 14,15 superconducting circuits, 16,17 NMR system, 18‐25 NV center, 26 and so on. However, it remains a major challenge in solving practical problems with these quantum algorithms at present, which is related to the limited number of qubits and the relative low gates fidelity under the current noisy intermediate‐scale quantum (NISQ) devices 27 …”
Section: Introductionmentioning
confidence: 99%