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

arXiv:quant-ph/0310091 · Physics Letters A

Experimental realization of the quantum box problem

Kevin J. Resch, Jeff S. Lundeen, Aephraim M. Steinberg

Published Feb 27, 2004• 213 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2004.02.042

Related papers

Experimental Aspects of Quantum Computing

Henry O. Everitt

Springer eBooks•Jan 1, 2005•38 citations

Experimental Realization of a One-Way Quantum Computer Algorithm Solving Simon’s Problem

Mark Tame, Bryn A. Bell, Carlo D. Franco +2 more

We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's problem-a black-box period-finding problem that has an exponential gap between the classical and quantum runtime. Using an all-optical setup and modifying the bases of single-qubit measurements on a five-qubit cluster state, key representative functions of the logical two-qubit version's black box can be queried and solved. To the best of our knowledge, this work represents the first experimental realization of the quantum algorithm solving Simon's problem. The experimental results are in excellent agreement with the theoretical model, demonstrating the successful performance of the algorithm. With a view to scaling up to larger numbers of qubits, we analyze the resource requirements for an n-qubit version. This work helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.

arXiv:1410.3859•Physical Review Letters•Nov 11, 2014•33 citations

Experimental realization of a quantum algorithm

Isaac L. Chuang, Lieven M. K. Vandersypen, Xinlan Zhou +2 more

arXiv:quant-ph/9801037•Nature•May 1, 1998•602 citations

Non-classical computing problems: Toward novel type of quantum computing problems

Mohammed Zidan, Hichem Eleuch, Mahmoud Abdel‐Aty

Quantum teleportation draws our attention to propose a new type of problems which can not be solved using classical computers. In this paper, we propose one of these problems. Concretely, this paper extends the definition of Deutsch’s problem to decide whether a black box Uf applied on a given unknown qubit α|0〉+β|1〉, such that |α|>0,|β|>0,and|α|≠|β|, is constant or balanced Boolean function, besides, estimation of |α| and |β|. Although, this problem is very simple but it can not be solved using classical computers, because qubit can not be implemented physically using classical computers. A novel quantum algorithm based on principle of entanglement measure is proposed to solve this problem. IBMs 5-qubit quantum computer (ibmqx4) is used to realize the proposed algorithm experimentally.

Results in Physics•Nov 2, 2020•47 citations

Experimental Distillation of Quantum Nonlocality

Chong Zu, Dong-Ling Deng, Pan‐Yu Hou +3 more

We report the first experimental demonstration of distillation of quantum nonlocality, confirming the recent theoretical protocol [Phys. Rev. Lett. 102, 120401 (2009)]. Quantum nonlocality is described by a correlation box with binary inputs and outputs, and the nonlocal boxes are realized through appropriate measurements on polarization entangled photon pairs. We demonstrate that nonlocality is amplified by connecting two nonlocal boxes into a composite one through local operations and four-photon measurements.

arXiv:1305.4212•Physical Review Letters•Aug 2, 2013•7 citations

Experimental aspects of quantum computing

Dipankar Bhattacharyya, Jyotirmoy Guha

Institute of Physics eBooks•Jan 1, 2022•1 citation
We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's problem-a black-box period-finding problem that has an exponential gap between the classical and quantum runtime. Using an all-optical setup and modifying the bases of single-qubit measurements on a five-qubit cluster state, key representative functions of the logical two-qubit version's black box can be queried and solved. To the best of our knowledge, this work represents the first experimental realization of the quantum algorithm solving Simon's problem. The experimental results are in excellent agreement with the theoretical model, demonstrating the successful performance of the algorithm. With a view to scaling up to larger numbers of qubits, we analyze the resource requirements for an n-qubit version. This work helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.
Quantum teleportation draws our attention to propose a new type of problems which can not be solved using classical computers. In this paper, we propose one of these problems. Concretely, this paper extends the definition of Deutsch’s problem to decide whether a black box Uf applied on a given unknown qubit α|0〉+β|1〉, such that |α|>0,|β|>0,and|α|≠|β|, is constant or balanced Boolean function, besides, estimation of |α| and |β|. Although, this problem is very simple but it can not be solved using classical computers, because qubit can not be implemented physically using classical computers. A novel quantum algorithm based on principle of entanglement measure is proposed to solve this problem. IBMs 5-qubit quantum computer (ibmqx4) is used to realize the proposed algorithm experimentally.
We report the first experimental demonstration of distillation of quantum nonlocality, confirming the recent theoretical protocol [Phys. Rev. Lett. 102, 120401 (2009)]. Quantum nonlocality is described by a correlation box with binary inputs and outputs, and the nonlocal boxes are realized through appropriate measurements on polarization entangled photon pairs. We demonstrate that nonlocality is amplified by connecting two nonlocal boxes into a composite one through local operations and four-photon measurements.