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

Circuits for Distributing Quantum Measurement

Prasanta Kumar Panigrahi, Manish K. Gupta, Anirban Pathak, R. Srikanth

Published Jan 1, 2006• 11 citations
Publisher

Abstract

We provide explicit quantum circuits for the distributed measurement of Bell states in the Hilbert space Cdn, where d is qudit dimension. We discuss a method for generalizing this to distributed measurements on any set of orthogonal states distributed among n parties. From the practical viewpoint, we show that such distributed measurements can help lower quantum communication complexity under certain conditions.

DOI
10.1063/1.2400891

Related papers

GENERAL CIRCUITS FOR INDIRECTING AND DISTRIBUTING MEASUREMENT IN QUANTUM COMPUTATION

M. GUPTA, Anirban Pathak, R. Srikanth +1 more

A question of theoretical and practical interest is how a quantum system may be measured indirectly by means of an ancilla that interacts with it, and furthermore, how a system of ancillas may be used to implement a coherent measurement of spatially separated qudits. We provide general circuits that can be used to implement such measurements. These circuits are relevant to quantum error correction, measurement-based quantum computation and Bell state discrimination across a quantum network involving multiple parties. The last mentioned problem is treated in detail. Our circuitry can also help to optimize the quantum communication complexity for performing measurements in distributed quantum computing.

International Journal of Quantum Information•Aug 1, 2007•23 citations

Quantum information splitting with many-party controllers

Min Jiang, Frank Jiang

In this paper, we develop an efficient and economic scheme in distributing quantum information scenario for remote partners via the control of many agents that are constrained by limited resources in a quantum communication network. Within such a network, quantum information is composed of multiple independent multi-qudit states, although each controlling agent is assigned only one controlling qudit, the agent can still control the distribution of all the quantum information. This scheme involves only generalized Bell-state measurement, single-qudit measurement and one-qudit gates, leading to a more flexible and achievable physical implementation.

World Congress on Intelligent Control and Automation•Jun 1, 2014•0 citations

Two-qubit state sharing between N parties using only Bell pairs and Bell-measurement

Razieh Annabestani, Vahid Karimipour

A quantum protocol for sharing an arbitrary two-qubit state between N parties is introduced. Any of the members, can retrieve the state, only with collaboration of the other parties. We will show that in terms of resources, i.e. the number of classical bits, the number of Bell pairs shared, and also the type of measurements, our protocol is more efficient. For achieving this, we introduce the basic technique of secure passing of an unknown two qubit state among a sequence of parties, none of which can retrieve the state without authorization of the sender and the other members of the group.

arXiv:0906.2555•Jun 14, 2009•0 citations

A special simplex in the state space for entangled qudits

Bernhard Baumgartner, Beatrix C. Hiesmayr, Heide Narnhofer

The focus is on two parties with Hilbert spaces of dimension d , i.e. 'qudits'. In the state space of these two possibly entangled qudits an analogue to the well-known tetrahedron with the four qubit Bell states at the vertices is presented. The simplex analogue to this magic tetrahedron includes mixed states. Each of these states appears to each of the two parties as the maximally mixed state. Some studies on these states are performed, and special elements of this set are identified. A large number of them are included in the chosen simplex which fits exactly into conditions needed for teleportation and other applications. Its rich symmetry—related to that of a classical phase space—helps to study entanglement, to construct witnesses and perform partial transpositions. This simplex has been explored in detail for d = 3. In this paper, the mathematical background and extensions to arbitrary dimensions are analysed.

arXiv:quant-ph/0610100•Journal of Physics A Mathematical and Theoretical•Jun 27, 2007•103 citations

Quantum Probes Reduce Measurements: Application to Distributed Grover Algorithm

Iaakov Exman, Efrat Levy

Distributed computing seems to be a natural approach to overcome size limitations of quantum computers in terms of number of qubits. But one lacks an efficient distribution approach to deal systematically with potential algorithms. This work proposes suitable quantum probes to reduce measurements in distributed sub-systems. Probes are introduced in the context of distributed Grover search. These are shown to be indeed efficient. The latter can be generalized to be applicable to other distributed algorithms of interest.

arXiv:1208.3905•Aug 20, 2012•1 citation

Local distinguishability with preservation of entanglement

Scott M. Cohen

I consider the deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement that entanglement must be preserved in the process. Several general theorems aimed at characterizing sets of states with which the parties can succeed in such a task are proven. These include (i) a maximum for the number of states when the Schmidt rank of every outcome must be at least a given minimum, (ii) an upper bound (equal to the dimension of Hilbert space if entanglement need not be preserved) for the sum over Schmidt ranks of the initial states when only one-way classical communication is allowed, and (iii) separately, a necessary and a sufficient condition on the states such that their original Schmidt ranks can always be preserved. Two additional theorems explicitly demonstrate a trade-off between the extent to which the set of states fill Hilbert space, as measured by their Schmidt ranks, and how refined the parties must make their measurements, an important factor in determining the Schmidt rank the state can retain after it has been identified. It is shown that our bound on the sum of Schmidt ranks can be exceeded if two-way communication is permitted, and this includes the case that entanglement need not be preserved, so that this sum can exceed the dimension of Hilbert space. Such questions, concerning how the various results are affected by the resources used by the parties (amount of classical communication and types of local operations), are addressed for each theorem. This subject is closely related to the problem of locally purifying an entangled state from a mixed state, which is of direct relevance to teleportation and dense coding using a mixed-state resource. In an appendix, I give an extremely simple and transparent proof of ``nonlocality without entanglement,'' a phenomenon originally discussed by Bennett and co-workers several years ago.

arXiv:quant-ph/0602026•Physical Review A•May 10, 2007•86 citations
We provide explicit quantum circuits for the distributed measurement of Bell states in the Hilbert space Cdn, where d is qudit dimension. We discuss a method for generalizing this to distributed measurements on any set of orthogonal states distributed among n parties. From the practical viewpoint, we show that such distributed measurements can help lower quantum communication complexity under certain conditions.
A question of theoretical and practical interest is how a quantum system may be measured indirectly by means of an ancilla that interacts with it, and furthermore, how a system of ancillas may be used to implement a coherent measurement of spatially separated qudits. We provide general circuits that can be used to implement such measurements. These circuits are relevant to quantum error correction, measurement-based quantum computation and Bell state discrimination across a quantum network involving multiple parties. The last mentioned problem is treated in detail. Our circuitry can also help to optimize the quantum communication complexity for performing measurements in distributed quantum computing.
In this paper, we develop an efficient and economic scheme in distributing quantum information scenario for remote partners via the control of many agents that are constrained by limited resources in a quantum communication network. Within such a network, quantum information is composed of multiple independent multi-qudit states, although each controlling agent is assigned only one controlling qudit, the agent can still control the distribution of all the quantum information. This scheme involves only generalized Bell-state measurement, single-qudit measurement and one-qudit gates, leading to a more flexible and achievable physical implementation.
A quantum protocol for sharing an arbitrary two-qubit state between N parties is introduced. Any of the members, can retrieve the state, only with collaboration of the other parties. We will show that in terms of resources, i.e. the number of classical bits, the number of Bell pairs shared, and also the type of measurements, our protocol is more efficient. For achieving this, we introduce the basic technique of secure passing of an unknown two qubit state among a sequence of parties, none of which can retrieve the state without authorization of the sender and the other members of the group.
The focus is on two parties with Hilbert spaces of dimension d , i.e. 'qudits'. In the state space of these two possibly entangled qudits an analogue to the well-known tetrahedron with the four qubit Bell states at the vertices is presented. The simplex analogue to this magic tetrahedron includes mixed states. Each of these states appears to each of the two parties as the maximally mixed state. Some studies on these states are performed, and special elements of this set are identified. A large number of them are included in the chosen simplex which fits exactly into conditions needed for teleportation and other applications. Its rich symmetry—related to that of a classical phase space—helps to study entanglement, to construct witnesses and perform partial transpositions. This simplex has been explored in detail for d = 3. In this paper, the mathematical background and extensions to arbitrary dimensions are analysed.
Distributed computing seems to be a natural approach to overcome size limitations of quantum computers in terms of number of qubits. But one lacks an efficient distribution approach to deal systematically with potential algorithms. This work proposes suitable quantum probes to reduce measurements in distributed sub-systems. Probes are introduced in the context of distributed Grover search. These are shown to be indeed efficient. The latter can be generalized to be applicable to other distributed algorithms of interest.
I consider the deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement that entanglement must be preserved in the process. Several general theorems aimed at characterizing sets of states with which the parties can succeed in such a task are proven. These include (i) a maximum for the number of states when the Schmidt rank of every outcome must be at least a given minimum, (ii) an upper bound (equal to the dimension of Hilbert space if entanglement need not be preserved) for the sum over Schmidt ranks of the initial states when only one-way classical communication is allowed, and (iii) separately, a necessary and a sufficient condition on the states such that their original Schmidt ranks can always be preserved. Two additional theorems explicitly demonstrate a trade-off between the extent to which the set of states fill Hilbert space, as measured by their Schmidt ranks, and how refined the parties must make their measurements, an important factor in determining the Schmidt rank the state can retain after it has been identified. It is shown that our bound on the sum of Schmidt ranks can be exceeded if two-way communication is permitted, and this includes the case that entanglement need not be preserved, so that this sum can exceed the dimension of Hilbert space. Such questions, concerning how the various results are affected by the resources used by the parties (amount of classical communication and types of local operations), are addressed for each theorem. This subject is closely related to the problem of locally purifying an entangled state from a mixed state, which is of direct relevance to teleportation and dense coding using a mixed-state resource. In an appendix, I give an extremely simple and transparent proof of ``nonlocality without entanglement,'' a phenomenon originally discussed by Bennett and co-workers several years ago.