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

Quantum Information Processing

Optimized search for complex protocols based on entanglement detection

Khaled Khalfaoui, Elhillali Kerkouche, Tahar Boudjedaa, Allaoua Chaoui

Published Jun 1, 2022• 4 citations
Publisher
DOI
10.1007/s11128-022-03550-5

Related papers

Can quantum entanglement detection schemes improve search?

Luís Tarrataca, Andreas Wichert

arXiv:1502.01959•Quantum Information Processing•Feb 15, 2011•2 citations

Separation between entanglement criteria and entanglement detection protocols

Zhenhuan Liu, Fuchuan Wei

Entanglement detection is one of the most fundamental tasks in quantum information science, playing vital roles in theoretical studies and quantum system benchmarking. Researchers have proposed many powerful entanglement criteria with high detection capabilities and small observable numbers. Nonetheless, entanglement criteria only represent mathematical rules deciding the existence of entanglement. The relationship between a good entanglement criterion and an effective experimental entanglement detection protocol (EDP) is poorly understood. In this study, we introduce postulates for EDPs about their detection capabilities and robustness and use them to show the difference between entanglement criteria and EDPs. Specifically, we design an entanglement detection task for unknown pure bipartite states and demonstrate that the sample complexity of any EDP and the number of observables for a good entanglement criterion can have exponential separation. Furthermore, we discover that the optimal EDP with the lowest sample complexity does not necessarily correspond to an entanglement criterion constructed by a small number of observables. Our results can be used to prove the exponential speedups achieved through quantum memory and be generalized to multipartite entanglement detection. By highlighting the significance and independence of EDP design, our work holds practical implications for entanglement detection experiments.

arXiv:2403.01664•Physical Review Research•Jul 23, 2025•6 citations

Optimized Detection of High-Dimensional Entanglement

Xiao-Min Hu, Wen-Bo Xing, Yu Guo +9 more

Entanglement detection is one of the most conventional tasks in quantum information processing. While most experimental demonstrations of high-dimensional entanglement rely on fidelity-based witnesses, these are powerless to detect entanglement within a large class of entangled quantum states, the so-called unfaithful states. In this Letter, we introduce a highly flexible automated method to construct optimal tests for entanglement detection given a bipartite target state of arbitrary dimension, faithful or unfaithful, and a set of local measurement operators. By restricting the number or complexity of the considered measurement settings, our method outputs the most convenient protocol which can be implemented using a wide range of experimental techniques such as photons, superconducting qudits, cold atoms, or trapped ions. With an experimental quantum optics setup that can prepare and measure arbitrary high-dimensional mixed states, we implement some three-setting protocols generated by our method. These protocols allow us to experimentally certify two- and three-unfaithful entanglement in four-dimensional photonic states, some of which contain well above 50% of noise.

arXiv:2011.02217•Physical Review Letters•Nov 22, 2021•21 citations

Entanglement in the Quantum Search Algorithm

Shantanav Chakraborty

•May 1, 2013•0 citations

Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

Rahul Jain, Sen, Pranab, Jaikumar Radhakrishnan

We show optimal Direct Sum result for the one-way entanglement-assisted quantum communication complexity for any relation f subset of X x Y x Z. We show: Q^{1,pub}(f^m) = Omega(m Q^{1,pub}(f)), where Q^{1,pub}(f), represents the one-way entanglement-assisted quantum communication complexity of f with error at most 1/3 and f^m represents m-copies of f. Similarly for the one-way public-coin classical communication complexity we show: R^{1,pub}(f^m) = Omega(m R^{1,pub}(f)), where R^{1,pub}(f), represents the one-way public-coin classical communication complexity of f with error at most 1/3. We show similar optimal Direct Sum results for the Simultaneous Message Passing quantum and classical models. For two-way protocols we present optimal Privacy Trade-off results leading to a Weak Direct Sum result for such protocols. We show our Direct Sum and Privacy Trade-off results via message compression arguments which also imply a new round elimination lemma in quantum communication. This allows us to extend classical lower bounds on the cell probe complexity of some data structure problems, e.g. Approximate Nearest Neighbor Searching on the Hamming cube {0,1}^n and Predecessor Search to the quantum setting. In a separate result we show that Newman's technique of reducing the number of public-coins in a classical protocol cannot be lifted to the quantum setting. We do this by defining a general notion of black-box reduction of prior entanglement that subsumes Newman's technique. We prove that such a black-box reduction is impossible for quantum protocols. In the final result in the theme of message compression, we provide an upper bound on the problem of Exact Remote State Preparation.

arXiv:0807.1267•Jul 8, 2008•34 citations

Moving quantum sensors

Evan Zhang, Erfan Abbasgholinejad, Yu-Xin Wang +6 more

We investigate whether controlled motion of a quantum sensor offers a metrological advantage in a field-detection task. We consider a localized field of known strength $B$ occupying an unknown contiguous region making up a fraction $1/N$ of the total search space, with a qubit sensor controlled for a total time $T$ to maximize the probability of detecting the field. We study the regime in which the characteristic timescale of the field is slow compared to the time to move the sensor between any two regions, and we distinguish classical motion, where the sensor follows a definite trajectory, from quantum motion, where the sensor can be in a coherent superposition of locations. For a single classically moving sensor, we derive an optimal multi-stop protocol and obtain the exact maximum detection probability. Allowing coherent spatial superposition maps the single-sensor problem onto Hamiltonian search and reduces the interrogation time for successfully detecting the field from $Θ(N/B)$ to $Θ(\sqrt{N}/B)$. We then extend the problem to $M$ sensors and identify a hierarchy of optimal time scalings for constant success probability determined by the available spatial and inter-sensor quantum resources. Unentangled coherently moving sensors achieve $T=Θ(\sqrt{N/M}/B)$ by searching disjoint regions in parallel, while entanglement among the sensors can further enhance the effective field coupling and achieve $T=Θ(\sqrt{N}/(MB))$. Matching lower bounds establish the optimality of these scalings in the presence of arbitrary controls and ancilla systems. Our results separate the roles of classical motion, spatial coherence, and entanglement in spatial field detection.

quant-pharXiv:2610.17176•Oct 13, 2026•0 citations
Entanglement detection is one of the most fundamental tasks in quantum information science, playing vital roles in theoretical studies and quantum system benchmarking. Researchers have proposed many powerful entanglement criteria with high detection capabilities and small observable numbers. Nonetheless, entanglement criteria only represent mathematical rules deciding the existence of entanglement. The relationship between a good entanglement criterion and an effective experimental entanglement detection protocol (EDP) is poorly understood. In this study, we introduce postulates for EDPs about their detection capabilities and robustness and use them to show the difference between entanglement criteria and EDPs. Specifically, we design an entanglement detection task for unknown pure bipartite states and demonstrate that the sample complexity of any EDP and the number of observables for a good entanglement criterion can have exponential separation. Furthermore, we discover that the optimal EDP with the lowest sample complexity does not necessarily correspond to an entanglement criterion constructed by a small number of observables. Our results can be used to prove the exponential speedups achieved through quantum memory and be generalized to multipartite entanglement detection. By highlighting the significance and independence of EDP design, our work holds practical implications for entanglement detection experiments.
Entanglement detection is one of the most conventional tasks in quantum information processing. While most experimental demonstrations of high-dimensional entanglement rely on fidelity-based witnesses, these are powerless to detect entanglement within a large class of entangled quantum states, the so-called unfaithful states. In this Letter, we introduce a highly flexible automated method to construct optimal tests for entanglement detection given a bipartite target state of arbitrary dimension, faithful or unfaithful, and a set of local measurement operators. By restricting the number or complexity of the considered measurement settings, our method outputs the most convenient protocol which can be implemented using a wide range of experimental techniques such as photons, superconducting qudits, cold atoms, or trapped ions. With an experimental quantum optics setup that can prepare and measure arbitrary high-dimensional mixed states, we implement some three-setting protocols generated by our method. These protocols allow us to experimentally certify two- and three-unfaithful entanglement in four-dimensional photonic states, some of which contain well above 50% of noise.
We show optimal Direct Sum result for the one-way entanglement-assisted quantum communication complexity for any relation f subset of X x Y x Z. We show: Q^{1,pub}(f^m) = Omega(m Q^{1,pub}(f)), where Q^{1,pub}(f), represents the one-way entanglement-assisted quantum communication complexity of f with error at most 1/3 and f^m represents m-copies of f. Similarly for the one-way public-coin classical communication complexity we show: R^{1,pub}(f^m) = Omega(m R^{1,pub}(f)), where R^{1,pub}(f), represents the one-way public-coin classical communication complexity of f with error at most 1/3. We show similar optimal Direct Sum results for the Simultaneous Message Passing quantum and classical models. For two-way protocols we present optimal Privacy Trade-off results leading to a Weak Direct Sum result for such protocols. We show our Direct Sum and Privacy Trade-off results via message compression arguments which also imply a new round elimination lemma in quantum communication. This allows us to extend classical lower bounds on the cell probe complexity of some data structure problems, e.g. Approximate Nearest Neighbor Searching on the Hamming cube {0,1}^n and Predecessor Search to the quantum setting. In a separate result we show that Newman's technique of reducing the number of public-coins in a classical protocol cannot be lifted to the quantum setting. We do this by defining a general notion of black-box reduction of prior entanglement that subsumes Newman's technique. We prove that such a black-box reduction is impossible for quantum protocols. In the final result in the theme of message compression, we provide an upper bound on the problem of Exact Remote State Preparation.
We investigate whether controlled motion of a quantum sensor offers a metrological advantage in a field-detection task. We consider a localized field of known strength BBB occupying an unknown contiguous region making up a fraction 1/N1/N1/N of the total search space, with a qubit sensor controlled for a total time TTT to maximize the probability of detecting the field. We study the regime in which the characteristic timescale of the field is slow compared to the time to move the sensor between any two regions, and we distinguish classical motion, where the sensor follows a definite trajectory, from quantum motion, where the sensor can be in a coherent superposition of locations. For a single classically moving sensor, we derive an optimal multi-stop protocol and obtain the exact maximum detection probability. Allowing coherent spatial superposition maps the single-sensor problem onto Hamiltonian search and reduces the interrogation time for successfully detecting the field from Θ(N/B)Θ(N/B)Θ(N/B) to Θ(N/B)Θ(\sqrt{N}/B)Θ(N​/B). We then extend the problem to MMM sensors and identify a hierarchy of optimal time scalings for constant success probability determined by the available spatial and inter-sensor quantum resources. Unentangled coherently moving sensors achieve T=Θ(N/M/B)T=Θ(\sqrt{N/M}/B)T=Θ(N/M​/B) by searching disjoint regions in parallel, while entanglement among the sensors can further enhance the effective field coupling and achieve T=Θ(N/(MB))T=Θ(\sqrt{N}/(MB))T=Θ(N​/(MB)). Matching lower bounds establish the optimality of these scalings in the presence of arbitrary controls and ancilla systems. Our results separate the roles of classical motion, spatial coherence, and entanglement in spatial field detection.