Measurement-based Implementation Research Articles

Efficient entanglement purification based on noise guessing decoding

In this paper, we propose a novel bipartite entanglement purification protocol built upon hashing and upon the guessing random additive noise decoding (GRAND) approach recently devised for classical error correction codes. Our protocol offers substantial advantages over existing hashing protocols, requiring fewer qubits for purification, achieving higher fidelities, and delivering better yields with reduced computational costs. We provide numerical and semi-analytical results to corroborate our findings and provide a detailed comparison with the hashing protocol of Bennet et al. Although that pioneering work devised performance bounds, it did not offer an explicit construction for implementation. The present work fills that gap, offering both an explicit and more efficient purification method. We demonstrate that our protocol is capable of purifying states with noise on the order of 10% per Bell pair even with a small ensemble of 16 pairs. The work explores a measurement-based implementation of the protocol to address practical setups with noise. This work opens the path to practical and efficient entanglement purification using hashing-based methods with feasible computational costs. Compared to the original hashing protocol, the proposed method can achieve some desired fidelity with a number of initial resources up to one hundred times smaller. Therefore, the proposed method seems well-fit for future quantum networks with a limited number of resources and entails a relatively low computational overhead.

Applications and resource reductions in measurement-based variational quantum eigensolvers

We discuss the procedure for obtaining measurement-based implementations of quantum algorithms given by quantum circuit diagrams and how to reduce the required resources needed for a given measurement-based computation. This forms the foundation for quantum computing on photonic systems in the near term. To demonstrate that these ideas are well grounded we present three different problems which are solved by employing a measurement-based implementation of the variational quantum eigensolver algorithm (MBVQE). We show that by utilising native measurement-based gates rather than standard gates, such as the standard controlled not gate (CNOT), measurement-based quantum computations may be obtained that are both shallow and have simple connectivity while simultaneously exhibiting a large expressibility. We conclude that MBVQE has promising prospects for resource states that are not far from what is already available today.

Nonlinear Squeezing for Measurement-Based Non-Gaussian Operations in Time Domain

Quantum non-Gaussian gate is a missing piece to the realization of continuous-variable universal quantum operations in the optical system. In a measurement-based implementation of the cubic phase gate, a lowest-order non-Gaussian gate, non-Gaussian ancillary states that has a property we call nonlinear squeezing are required. This property, however, has never been experimentally verified. In this paper, we generate a superposition between a vacuum state and a single photon state whose nonlinear squeezing are maximized by the optimization of the superposition coefficients. The nonlinear squeezing is observed via real-time quadrature measurements, meaning that the generated states are compatible with the real-time feedforward and are suitable as the ancillary states for the cubic phase gate in time domain. Moreover, by increasing the number of the photons, it is expected that nonlinear squeezing can be further improved. The idea presented here can be readily extended to the higher-order phase gates [P. Marek et al., Phys. Rev. A 97, 022329 (2018)]. As such, this work presents an important step to extend the CV quantum information processing from Gaussian regime to non-Gaussian regime.

Supplemental Material for Measurement-Based Care Implementation in a Veterans Affairs Primary Care–Mental Health Integration Program

Supplemental Material for Measurement-Based Care Implementation in a Veterans Affairs Primary Care–Mental Health Integration Program

Multipartite state generation in quantum networks with optimal scaling

We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over arbitrary distances, with a constant overhead per node/channel that is independent of the distance. The approach is genuine multipartite, and is based on the measurement-based implementation of multipartite hashing, an entanglement purification protocol that operates on a large ensemble together with local merging/connection of elementary building blocks. We analyze the performance of the scheme in a setting where local or global storage is limited, and compare it to bipartite and hybrid approaches that are based on the distribution of entangled pairs. We find that the multipartite approach offers a storage advantage, which results in higher efficiency and better performance in certain parameter regimes. We generalize our approach to arbitrary network topologies and different target graph states.

Universal quantum computation with temporal-mode bilayer square lattices

We propose an experimental design for universal continuous-variable quantum computation that incorporates recent innovations in linear-optics-based continuous-variable cluster state generation and cubic-phase gate teleportation. The first ingredient is a protocol for generating the bilayer-square-lattice cluster state (a universal resource state) with temporal modes of light. With this state, measurement-based implementation of Gaussian unitary gates requires only homodyne detection. Second, we describe a measurement device that implements an adaptive cubic-phase gate, up to a random phase-space displacement. It requires a two-step sequence of homodyne measurements and consumes a (non-Gaussian) cubic-phase state.

Long-Range Big Quantum-Data Transmission.

We introduce an alternative type of quantum repeater for long-range quantum communication with improved scaling with the distance. We show that by employing hashing, a deterministic entanglement distillation protocol with one-way communication, one obtains a scalable scheme that allows one to reach arbitrary distances, with constant overhead in resources per repeater station, and ultrahigh rates. In practical terms, we show that, also with moderate resources of a few hundred qubits at each repeater station, one can reach intercontinental distances. At the same time, a measurement-based implementation allows one to tolerate high loss but also operational and memory errors of the order of several percent per qubit. This opens the way for long-distance communication of big quantum data.

Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification

While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable advantage in quantum devices without demanding quantum error correction, which is crucial for prolonging the coherence time of qubits. We propose a model device made of locally-interacting multiple qubits, designed such that simultaneous single-qubit measurements on it can output probability distributions whose average-case sampling is classically intractable, under similar assumptions as the sampling of non-interacting bosons and instantaneous quantum circuits. Notably, in contrast to these previous unitary-based realizations, our measurement-based implementation has two distinctive features. (i) Our implementation involves no adaptation of measurement bases, leading output probability distributions to be generated in constant time, independent of the system size. Thus, it could be implemented in principle without quantum error correction. (ii) Verifying the classical intractability of our sampling is done by changing the Pauli measurement bases only at certain output qubits. Our usage of random commuting quantum circuits in place of computationally universal circuits allows a unique unification of sampling and verification, so that they require the same physical resource requirements in contrast to the more demanding verification protocols seen elsewhere in the literature.

Characterization of a measurement-based noiseless linear amplifier and its applications

A noiseless linear amplifier (NLA) adds no noise to the signals it processes, which works only in a probabilistic way. It can be realized approximately with either a physical implementation that truncates the working space of the NLA on a photon-number basis or a measurement-based implementation that realizes the truncation virtually by a bounded postselection filter. To examine the relationship between these two approximate NLAs, we characterize in detail the measurement-based NLA and compare it with its physical counterpart in terms of their abilities to preserve the state Gaussianity and their probability of success. The link between these amplifiers is further clarified by integrating them into a measure-and-prepare setup. We stress the equivalence between the physical and the measurement-based approaches holds only when the effective parameters, the amplification gain, the cutoff, and the amplitude of the input state, are taken into account. Finally, we construct a 1-to-infinity cloner using the two amplifiers and show that a fidelity surpassing the no-cloning limit is achievable with the measurement-based NLA.

Measurement-based local quantum filters and their ability to transform quantum entanglement

We introduce local filters as a means to detect the entanglement of bound entangled states which do not yield to detection by witnesses based on positive (P) maps which are not completely positive (CP). We demonstrate how such non-detectable bound entangled states can be locally filtered into detectable bound entangled states. Specifically, we show that a bound entangled state in the orthogonal complement of the unextendible product bases (UPB), can be locally filtered into a another bound entangled state that is detectable by the Choi map. We reinterpret these filters as local measurements on locally extended Hilbert spaces. We give explicit constructions of a measurement-based implementation of these filters for $2 \otimes 2$ and $3 \otimes 3$ systems. This provides us with a physical mechanism to implement such local filters.

Measurement-based quantum communication with resource states generated by entanglement purification

We investigate measurement-based quantum communication with noisy resource states that are generated by entanglement purification. We consider the transmission of encoded information via noisy quantum channels using a measurement-based implementation of encoding, error correction and decoding. We show that such an approach offers advantages over direct transmission, gate-based error correction and measurement-based schemes with direct generation of resource states. We analyze the noise structure of resource states generated by entanglement purification and show that a local error model, i.e. noise acting independently on all qubits of the resource state, is a good approximation in general, and provides an exact description for $GHZ$-states. The latter are resources for a measurement-based implementation of error correction codes for bit-flip or phase flip errors. This provides a first link between the recently found very high thresholds for fault-tolerant measurement-based quantum information processing based on local error models for resource states, to error thresholds for gate based computational models.

Majorana box qubits

Quantum information protected by the topology of the storage medium is expected to exhibit long coherence times. Another feature is topologically protected gates generated through braiding of Majorana bound states (MBSs). However, braiding requires structures with branched topological segments which have inherent difficulties in the semiconductor–superconductor heterostructures now believed to host MBSs. In this paper, we construct quantum bits taking advantage of the topological protection and non-local properties of MBSs in a network of parallel wires, but without relying on braiding for quantum gates. The elementary unit is made from three topological wires, two wires coupled by a trivial superconductor and the third acting as an interference arm. Coulomb blockade of the combined wires spawns a fractionalized spin, non-locally addressable by quantum dots used for single-qubit readout, initialization, and manipulation. We describe how the same tools allow for measurement-based implementation of the Clifford gates, in total making the architecture universal. Proof-of-principle demonstration of topologically protected qubits using existing techniques is therefore within reach.

Repeated anticipatory network traffic control using iterative optimization accounting for model bias correction

Anticipatory signal control in traffic networks adapts the signal timings with the aim of controlling the resulting (equilibrium) flows and route choice patterns in the network. This study investigates a method to support control decisions for successful applications in real traffic systems that operate repeatedly, for instance from day to day, month to month, etc. The route choice response to signal control is usually predicted through models; however this leads to suboptimality because of unavoidable prediction errors between model and reality. This paper proposes an iterative optimizing control method to drive the traffic network towards the real optimal performance by observing modeling errors and correcting for them. Theoretical analysis of this Iterative Optimizing Control with Model Bias Correction (IOCMBC) on matching properties between the modeled optimal solution and the real optimum is presented, and the advantages over conventional iterative schemes are demonstrated. A local convergence analysis is also elaborated to investigate conditions required for a convergent scheme. The main innovation is the calculation of the sensitivity (Jacobian) information of the real route choice behavior with respect to signal control variables. To avoid performing additional perturbations, we introduce a measurement-based implementation method for estimating the operational Jacobian that is associated with the reality. Numerical tests confirm the effectiveness of the proposed IOCMBC method in tackling modeling errors, as well as the influence of the optimization step size on the reality-tracking convergence.

Measurement-based quantum communication

We review and discuss the potential of using measurement-based elements in quantum communication schemes, where certain tasks are realized with the help of entangled resource states that are processed by measurements. We consider long-range quantum communication based on the transmission of encoded quantum states, where encoding, decoding and syndrome read-out are implemented using small-scale resource states. We also discuss entanglement-based schemes and consider measurement-based quantum repeaters. An important element in these schemes is entanglement purification, which can also be implemented in a measurement-based way. We analyze the influence of noise and imperfections in these schemes, and show that measurement-based implementation allows for very large error thresholds of the order of 10\% noise per qubit and more. We show how to obtain optimal resource states for different tasks, and discuss first experimental realizations of measurement-based quantum error correction using trapped ions and photons.

Robustness of hashing protocols for entanglement purification

We investigate entanglement purification protocols based on hashing, where a large number of noisy entangled pairs are jointly processed to obtain a reduced number of perfect, noiseless copies. While hashing and breeding protocols are the only purification protocols that asymptotically obtain a nonzero yield, they are not applicable in a realistic scenario if local gates and measurements are imperfect. We show that such problems can be overcome by a compact measurement-based implementation, yielding entanglement purification schemes with nonzero yield that are applicable also in noisy scenarios, with tolerable noise per particle of several percent. We also generalize these findings to multiparty purification protocols for arbitrary graph states.

Universal and Optimal Error Thresholds for Measurement-Based Entanglement Purification

We investigate measurement-based entanglement purification protocols (EPP) in the presence of local noise and imperfections. We derive a universal, protocol-independent threshold for the required quality of the local resource states, where we show that local noise per particle of up to 24% is tolerable. This corresponds to an increase of the noise threshold by almost an order of magnitude, based on the joint measurement-based implementation of sequential rounds of few-particle EPP. We generalize our results to multipartite EPP, where we encounter similarly high error thresholds.

Controlled-NOT gate for multiparticle qubits and topological quantum computation based on parity measurements

We discuss a measurement-based implementation of a controlled-NOT (CNOT) quantum gate. Such a gate has recently been discussed for free electron qubits. Here we extend this scheme for qubits encoded in product states of two (or more) spins-1/2 or in equivalent systems. The key to such an extension is to find a feasible qubit-parity meter. We present a general scheme for reducing this qubit-parity meter to a local spin-parity measurement performed on two spins, one from each qubit. Two possible realizations of a multiparticle CNOT gate are further discussed: electron spins in double quantum dots in the singlet-triplet encoding, and nu=5/2 Ising non-Abelian anyons using topological quantum computation braiding operations and nontopological charge measurements.

A CAC Considering Both Intracell and Intercell Handoffs for Measurement-based DCA

Most call admission control (CAC) schemes proposed for dynamic channel allocation (DCA)-based systems simply follow the same philosophy as adopted by fixed channel allocation (FCA)-based systems, i.e., only considering intercell handoffs. Doing so is acceptable for FCA and coordinated DCA systems because an intracell handoff caused by a new channel assignment rarely happens in these cases. However, as discussed in this paper, in a distributed DCA with a measurement-based channel assignment, the intracell handoff may happen frequently and can dominate handoff events because failed intracell handoffs reduce the number of intercell handoffs. In this case, the CAC considering only the intercell handoff cannot work properly for such DCA systems. In this paper, we discuss a novel CAC to consider both intercell and intracell handoffs to guarantee a handoff call dropping probability (CDP) by jointly using the channel carrying approach. We also investigate a measurement-based implementation of this proposal through computer simulations. The results show that the proposed CAC can effectively bound the CDP to a target CDP

Dynamic optimization in the presence of uncertainty: From off-line nominal solution to measurement-based implementation

The problem of optimizing a dynamic system in the presence of uncertainty is typically tackled using measurements. The method most widely documented in the literature is based on repetitive optimization of an updated process model. Recently, a computationally less expensive alternative that is based on the real-time adaptation of a solution model using measurements has been proposed. The solution model, which relates elements of the input profiles to the set of active constraints and to appropriate sensitivities, has typically been derived manually from physical insight and intuition. This paper presents a systematic and automated approach to generate a solution model based on recent results in numerical optimization of dynamic systems. This concept provides the first step toward an entirely automated procedure for constrained dynamic optimization of uncertain large-scale processes.

Quality of service and flow level admission control in the Internet

We propose to apply an integrated admission control scheme to both streaming flows and elastic flows. It is assumed that streaming flow packets are served with priority in network queues so that admission control ensures minimal delay for audio and video applications while preserving the throughput of document transfers. An implicit measurement-based implementation is proposed where admissibility is based on an estimation of the bandwidth a new elastic flow would acquire. An analytical fluid flow model provides insight and guides the choice of admission thresholds. Detailed packet level simulations of TCP and UDP connections show that the proposed algorithms work satisfactorily in the range of admission thresholds predicted by the fluid model.