Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

AIP conference proceedings

Linear Preparation Method of Pseudo-Pure States while Correcting Errors and Enhancing Signals for NMR Quantum Computer

Minaru Kawamura, H. Sakai, Yoshinori Manmoto, Alexander I. Lvovsky

Published Jan 1, 2009• 0 citations
Publisher
DOI
10.1063/1.3131334

Related papers

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

Tao Xin, Liang Hao, Shi‐Yao Hou +2 more

Science China Physics Mechanics and Astronomy•Mar 29, 2019•15 citations

Preparation of pseudo-pure states by line-selective pulses in nuclear magnetic resonance

Xinhua Peng, Xiwen Zhu, Ximing Fang +4 more

arXiv:quant-ph/0012038•Chemical Physics Letters•Jun 1, 2001•63 citations

Preparation of effective pure states $\mid 00 \cdots 0 \rangle$ on an NMR quantum computer with any number of spins (Analytical Study of Quantum Information and Related Fields)

潮 坂口, 宏 小澤, 俊夫 福見

数理解析研究所講究録•Apr 1, 2001•0 citations

Feedback Error Correction Method of Creating Pseudo-Pure States for NMR Quantum Computers

Minaru Kawamura

In this paper, a feedback error correction method of creating pseudo-pure states for large scale nuclear magnetic resonance quantum computers (NMR-QC) is proposed that is aimed at creating the initial states asymptotically within a specified error tolerance by using a spatial averaging method. The present method enables almost complete error correction and even enhances the NMR signal compared with the initial state. An implementation of this method was successfully demonstrated on a five-qubit NMR-QC.

•Jan 1, 2009•0 citations

Preparation of pseudo-pure states by line-selective pulses in Nuclear Magnetic Resonance

Xinhua Peng, Xiwen Zhu, Ximing Fang +4 more

A new method of preparing the pseudo-pure state of a spin system for quantum computation in liquid nuclear magnetic resonance (NMR) was put forward and demonstrated experimentally. Applying appropriately connected line-selective pulses simultaneously and a field gradient pulse techniques we acquired straightforwardly all pseudo-pure states for two qubits in a single experiment much efficiently. The signal intensity with the pseudo-pure state prepared in this way is the same as that of temporal averaging. Our method is suitable for the system with arbitrary numbers of qubits. As an example of application, a highly structured search algorithm—-Hogg’s algorithm was also performed on the pseudo-pure state | 00 〉 prepared by our method.

•Jan 1, 2000•38 citations

Introduction to NMR Quantum Computing

Ivan S. Oliveira, Tito José Bonagamba, Roberto S. Sarthour +2 more

Elsevier eBooks•Jan 1, 2007•6 citations
Preparation of effective pure states ∣00⋯0⟩\mid 00 \cdots 0 \rangle∣00⋯0⟩ on an NMR quantum computer with any number of spins (Analytical Study of Quantum Information and Related Fields)
In this paper, a feedback error correction method of creating pseudo-pure states for large scale nuclear magnetic resonance quantum computers (NMR-QC) is proposed that is aimed at creating the initial states asymptotically within a specified error tolerance by using a spatial averaging method. The present method enables almost complete error correction and even enhances the NMR signal compared with the initial state. An implementation of this method was successfully demonstrated on a five-qubit NMR-QC.
A new method of preparing the pseudo-pure state of a spin system for quantum computation in liquid nuclear magnetic resonance (NMR) was put forward and demonstrated experimentally. Applying appropriately connected line-selective pulses simultaneously and a field gradient pulse techniques we acquired straightforwardly all pseudo-pure states for two qubits in a single experiment much efficiently. The signal intensity with the pseudo-pure state prepared in this way is the same as that of temporal averaging. Our method is suitable for the system with arbitrary numbers of qubits. As an example of application, a highly structured search algorithm—-Hogg’s algorithm was also performed on the pseudo-pure state | 00 〉 prepared by our method.