“…We firstly consider the case of a fully non-locally N -controlled unitary having M target qubits. In this scenario, the protocols of 8 , 9 , 12 reduce to the circuit in Fig. 1 .…”
Section: Discussionmentioning
confidence: 99%
“…While this work shows that the system requirements for distributing a quantum function is the same as for a controlled unitary, the specific implementation of the previously mentioned protocols 8 , 9 have the disadvantage that they require a large number of ancillary qubits at the target site. Figure 1 Multipartite distribution of N -qubit quantum functions 9 . …”
Section: Introductionmentioning
confidence: 94%
“…One of the first steps in this direction was the distribution of controlled unitary gates 8 , the quantum equivalents of the if programmatic statement. Using the observation that any function can be written as a sequence of if statements, this protocol was recently generalized to allow the distribution at no additional cost of quantum functions 9 , including the Deutsch and Grover oracles, and even the fast modular exponentiation function which is the bottle-necking factor in Shor’s algorithm. While this work shows that the system requirements for distributing a quantum function is the same as for a controlled unitary, the specific implementation of the previously mentioned protocols 8 , 9 have the disadvantage that they require a large number of ancillary qubits at the target site.…”
Section: Introductionmentioning
confidence: 99%
“…The distribution of a quantum function 9 (and particularly N -control unitaries 8 ) starts by sharing each of the “control” qubits with the computer containing the “target” qubits , using N additional Bell pairs whose halves we denote by (at the control site) and (at the target site). The protocol then locally applies the quantum function , and finally decommissions the extra qubits, as shown in Fig.…”
Section: Introductionmentioning
confidence: 99%
“…1 . This last step is required to avoid residual entanglement, and follows the transfer procedure discussed in 9 , 10 . Yet, the point of both protocols is not to circumvent register size limits, but rather to allow the processing of non-local data, and as such they both make use of a local copy of the gate.…”
Factoring a 2048-bit number using Shor’s algorithm, when accounting for error correction, reportedly requires 400,000 qubits. However, it is well known that there is yet much time before we will have this many qubits in the same local system. This is why we propose a protocol for distributed quantum computation applicable to small register devices, specifically for the distribution of controlled unitary gates, the key element in the construction of every quantum computation algorithm. We leverage quantum sharing of partial results to obtain a parallel processing scheme, allowing for the first time the quantum distribution of very large gates with thousands of inputs using only small register devices with tens of qubits. In this way, we improve all previous controlled unitary gate distribution approaches, obtaining surprising results. The impact is quantified for recent milestone hardware realizations of quantum processors.
“…We firstly consider the case of a fully non-locally N -controlled unitary having M target qubits. In this scenario, the protocols of 8 , 9 , 12 reduce to the circuit in Fig. 1 .…”
Section: Discussionmentioning
confidence: 99%
“…While this work shows that the system requirements for distributing a quantum function is the same as for a controlled unitary, the specific implementation of the previously mentioned protocols 8 , 9 have the disadvantage that they require a large number of ancillary qubits at the target site. Figure 1 Multipartite distribution of N -qubit quantum functions 9 . …”
Section: Introductionmentioning
confidence: 94%
“…One of the first steps in this direction was the distribution of controlled unitary gates 8 , the quantum equivalents of the if programmatic statement. Using the observation that any function can be written as a sequence of if statements, this protocol was recently generalized to allow the distribution at no additional cost of quantum functions 9 , including the Deutsch and Grover oracles, and even the fast modular exponentiation function which is the bottle-necking factor in Shor’s algorithm. While this work shows that the system requirements for distributing a quantum function is the same as for a controlled unitary, the specific implementation of the previously mentioned protocols 8 , 9 have the disadvantage that they require a large number of ancillary qubits at the target site.…”
Section: Introductionmentioning
confidence: 99%
“…The distribution of a quantum function 9 (and particularly N -control unitaries 8 ) starts by sharing each of the “control” qubits with the computer containing the “target” qubits , using N additional Bell pairs whose halves we denote by (at the control site) and (at the target site). The protocol then locally applies the quantum function , and finally decommissions the extra qubits, as shown in Fig.…”
Section: Introductionmentioning
confidence: 99%
“…1 . This last step is required to avoid residual entanglement, and follows the transfer procedure discussed in 9 , 10 . Yet, the point of both protocols is not to circumvent register size limits, but rather to allow the processing of non-local data, and as such they both make use of a local copy of the gate.…”
Factoring a 2048-bit number using Shor’s algorithm, when accounting for error correction, reportedly requires 400,000 qubits. However, it is well known that there is yet much time before we will have this many qubits in the same local system. This is why we propose a protocol for distributed quantum computation applicable to small register devices, specifically for the distribution of controlled unitary gates, the key element in the construction of every quantum computation algorithm. We leverage quantum sharing of partial results to obtain a parallel processing scheme, allowing for the first time the quantum distribution of very large gates with thousands of inputs using only small register devices with tens of qubits. In this way, we improve all previous controlled unitary gate distribution approaches, obtaining surprising results. The impact is quantified for recent milestone hardware realizations of quantum processors.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
