Swapping Scheme Research Articles

Teleportation of Multiparticle Entangled States

This paper investigates the theoretical basis and actual methods for teleporting entangled states using multiple particles. Beginning with Bennett et al.'s pioneering work in 1993, which established the notion of quantum teleportation. In this paper, I will discuss the quantum teleportation, quantum entanglement, Entanglement schemes such as Entanglement swapping scheme and will find out the rate of successful teleportation in terms of fidelity. Additionally discussed is minimal assured fidelity, which is the lowest level of fidelity for any unknown quantum information about the states[1]. Additionally, the success rate of teleporting a superposition of odd and even coherent states is demonstrated to be able to be raised from 50% to almost 99%[2]. We discover that by just isolating the vacuum state from the even state, it can virtually transport, divert, and exchange. Key Words: Entanglement, Quantum teleportation, Entanglement swapping scheme, Bell state measurement (BSM), Quantum information.

Deterministic preparation of optical qubits with coherent feedback control

We propose a class of preparation schemes for orbital angular momentum and polarization qubits carried by single photons or classical states of light based on coherent feedback control by an ancillary degree of freedom of light. The preparation methods use linear optics and include the transcription of an arbitrary polarization state onto a two-level OAM system (swap) for arbitrary OAM values ±ℓ within a light beam, i.e., without a spatial interferometer. The preparations can be carried out with unit efficiency independent from the potentially unknown initial state of the system. The swap scheme also allows us to implement arbitrary unitary gates on OAM qubits (±ℓ) by reducing them to polarization gates. In addition, we show how to translate measurement-based qubit control channels into coherent feedback schemes for optical implementation.

Low-cost nonlocal Toffoli gate in a linear quantum network topology

Although a Toffoli gate can be equivalently implemented using several single-qubit and two-qubit gates, it will consume much resource, two of which are nonlocal controlled-NOT (CNOT) gates acting on two non-adjacent nodes, especially in distributed quantum computation (DQC). We, for the first time, employ an ancillary qubit to construct a nonlocal Toffoli gate for DQC in linear network topology. The ancillary-qubit-based scheme needs fewer qubits, quantum gates, and entanglement states than that based on quantum teleportation scheme and the entanglement swapping scheme. We also analyze the performance of the three proposed schemes under different application scenarios, and present their pros and cons. Our work will help to implement DQC in noisy intermediate-scale quantum (NISQ) era.

All-optical Einstein-Podolsky-Rosen steering swapping.

Einstein-Podolsky-Rosen (EPR) steering, an important resource in quantum information, describes the ability of one party to influence the state of another party through local measurements. It differs from Bell nonlocality and entanglement due to its asymmetric property. EPR steering swapping allows two spatially independent parties to present EPR steering without direct interaction. Here, we theoretically propose an all-optical EPR steering swapping (AOSS) scheme based on low-noise high-broadband optical parametric amplifiers (OPAs). A low-noise high-broadband OPA is utilized to implement the function of Bell-state measurement without detection, avoiding the optic-electro and electro-optic conversions. After AOSS, one-way and two-way EPR steering between two independent optical modes can be obtained. Our scheme provides a guidance for the construction of a measurement-free, all-optical broadband quantum network utilizing EPR steering swapping.

An Efficient Scheduling Scheme of Swapping and Purification Operations for End-to-End Entanglement Distribution in Quantum Networks

An Efficient Scheduling Scheme of Swapping and Purification Operations for End-to-End Entanglement Distribution in Quantum Networks

Security Compliant and Cooperative Pseudonyms Swapping for Location Privacy Preservation in VANETs

Vehicular Ad-hoc Networks (VANETs) are an essential part of the Intelligent Transportation System (ITS). VANETs promise to offer drivers and passengers safety, traffic efficiency, and infotainment services. To this end, VANETs require vehicles to periodically broadcast unencrypted beacon messages that contain position, velocity, timestamp, and identity. Consequently, VANETs naturally expose users' identities and locations, facilitating tracking by an adversary. To address VANETs location privacy issues, researchers have proposed different pseudonym-based privacy-preserving techniques in the literature. One of the techniques is pseudonym swap. In pseudonym swap techniques, vehicles exchange pseudonyms with each other hence fewer pseudonyms for each vehicle since vehicles can reuse pseudonyms. However, existing pseudonym swap-based schemes either exchange pseudonyms via Roadside Units (RSUs) or ignore VANETs' security requirements by not informing the Certification Authority of the exchanges. Hence, they suffer from high RSUs deployment costs, inflexibility to location privacy preservation, unaccountability, and repudiation attacks. Moreover, the lower level of location privacy provided by the schemes demands further improvements. Therefore, we propose a novel pseudonym swap scheme that uses swappable and non-swappable pseudonyms to attain infrastructure independence while adhering to VANET security requirements. In this scheme, vehicles, independent of RSUs, cooperatively swap and change pseudonyms within mix-contexts having a high level of location privacy. Each exchange is then reported to the authority to enforce accountability and non-repudiation. Besides adhering to VANET security requirements, the simulation experiments show that our scheme outperforms existing pseudonym swap schemes, providing VANET users with a high level of location privacy.

Threshold effect for probabilistic entanglement swapping

The basic entanglement swapping protocol allows to project two qubits, which have never interacted, onto a maximally entangled state. For deterministic swapping, the key ingredient is the maximal entanglement that was initially contained in two pairs of qubits and the capacity of projecting onto a Bell basis. Thus the basic and deterministic entanglement swapping scheme involves three maximal level of entanglement. In this work we propose probabilistic entanglement swapping processes performed with different amounts of initial entanglement. Besides that we suggest a non Bell measuring-basis, to introduce a third entanglement level in the process. Additionally, we propose the unambiguous state extraction scheme as the local mechanism for probabilistically achieving the EPR projection. The combination of these three elements allows us to design four strategies for performing probabilistic entanglement swapping. Surprisingly, we find a twofold entanglement threshold effect related to the concurrence of the measuring-basis. Specifically, the maximal probability of accomplishing a EPR projection becomes a constant for concurrences higher than or equal to threshold entanglement value. Thus, we show that maximal entanglement in the measuring-basis is not required for attaining the EPR projection.

FSGANv2: Improved Subject Agnostic Face Swapping and Reenactment.

We present Face Swapping GAN (FSGAN) for face swapping and reenactment. Unlike previous work, we offer a subject agnostic swapping scheme that can be applied to pairs of faces without requiring training on those faces. We derive a novel iterative deep learning-based approach for face reenactment which adjusts significant pose and expression variations that can be applied to a single image or a video sequence. For video sequences, we introduce a continuous interpolation of the face views based on reenactment, Delaunay Triangulation, and barycentric coordinates. Occluded face regions are handled by a face completion network. Finally, we use a face blending network for seamless blending of the two faces while preserving the target skin color and lighting conditions. This network uses a novel Poisson blending loss combining Poisson optimization with a perceptual loss. We compare our approach to existing state-of-the-art systems and show our results to be both qualitatively and quantitatively superior. This work describes extensions of the FSGAN method, proposed in an earlier conference version of our work (Nirkin et al. 2019), as well as additional experiments and results.

Transients Improvement in the Output-Feedback Adaptive Backstepping Control of Nonlinear Systems with Input Constraints

The paper addresses the problem of transient performance improvement in the output-feedback adaptive backstepping control of parametrically uncertain nonlinear system represented in the cascaded output-feedback form. The system state is inaccessible for measurement, the system input is constrained, and the control gain is assumed unknown (its sign is known). The problem is solved by applying specially modified K-filters with adjustable parameter, using the backstepping procedure taking into account the input constraints, and involving the Kreisselmeier-like adaptation algorithm with a modified swapping scheme. The algorithm enables us to improve the closed-loop transient performance without increasing initial “swings” in the control error transients. The latter property is achieved by including the high-order time derivatives of the adjustable parameters, calculated by the adaptation algorithm, in the control law. The properties of the closed-loop system are illustrated via simulation.

Entangled Coherent States in Teleportation

In the present paper, we will review the methods to produce superposition of entangled coherent state using polarizing beam splitter and Kerr non linearity. These coherent states have many attractive features and can be used in various schemes. Entanglement, refers to the superposition of a multiparticle system and explains a new type of correlations between any two subsystems of the quantum system, which is not existing in the classical physics. The present paper deals with the use of these states in quantum teleportation, entanglement diversion and entanglement swapping schemes. Entanglement diversion and entanglement-swapping refers to a scheme which may entangle those particles which had never interacted before. In the swapping scheme, two pairs of entangled state are taken. One particle from each pair is subjected to a Bell-state-measurement. This would result in projection of the other two outgoing particles in an entangled pair. Quantum Teleportation of two mode and three modes states is also studied with perfect fidelity. Minimum assured fidelity which is defined as the minimum of the fidelity for any unknown quantum information of the states is also discussed. It is also shown how the success rate of teleportation of a superposition of odd and even coherent states can be increased from 50% to almost 100%. The scheme suggested by van Enk and Hirota was modified by Prakash, Chandra, Prakash and Shivani in 2007. We find that an almost teleportation, diversion and swapping is possible by simply separating vacuum state from the even state. The present paper also deals with study of effect of decoherence and noise on these states and the effect of noise on fidelity and minimum assured fidelity. It is also discussed that these schemes can also be applied to the process of entanglement diversion and entanglement swapping.

Tracy–Widom at each edge of real covariance and MANOVA estimators

We study the sample covariance matrix for real-valued data with general population covariance, as well as MANOVA-type covariance estimators in variance components models under null hypotheses of global sphericity. In the limit as matrix dimensions increase proportionally, the asymptotic spectra of such estimators may have multiple disjoint intervals of support, possibly intersecting the negative half line. We show that the distribution of the extremal eigenvalue at each regular edge of the support has a GOE Tracy–Widom limit. Our proof extends a comparison argument of Ji Oon Lee and Kevin Schnelli, replacing a continuous Green function flow by a discrete Lindeberg swapping scheme.

DAMPAK UTANG LUAR NEGERI TERHADAP PEREKONOMIAN INDONESIA

This study aims to describe: 1) how is the development of Indonesia’s foreign debt; 2) what are the impacts of foreign debt on the Indonesian economy; and 3) what are the policy alternatives that can be taken to minimize the negative impact of foreign debt on the Indonesian economy. This type of research is descriptive qualitative research. Data collection techniques used are observation and literature/documentation studies. Literature study is a data collection technique by conducting a review study of books, literature, notes, and reports that have to do with the problem being solved. The data in this study were obtained from various publications of government institutions such as Bank Indonesia, the Central Statistics Agency, and the Ministry of Finance of the Republic of Indonesia. The results of the study show that: 1) External debt is able to encourage Indonesia’s economic growth in economic sectors that absorb high external debt. 2) Domestic saving shows an increasing role. 3) The swap scheme can be considered as a solution to the high external debt. Keywords: foreign debt, impact, debt to serve ratio, public saving, Indonesian economy

Optimal Entanglement Swapping in Quantum Repeaters.

We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeaters' sizes. Based on this, weare able to demonstrate that the commonly used "doubling" scheme for performing probabilistic entanglement swapping of probabilistically distributed entangled qubit pairs in quantum repeaters does not always produce the best possible raw rate. Focusing on this figure of merit, without considering additional probabilistic elements for error suppression such as entanglement distillation on higher "nesting levels," our approach reveals that a power-of-two number of segments has no privileged position in quantum repeater theory; the best scheme can be constructed for any number of segments. Moreover, classical communication can be included into our scheme, and we show how this influences the raw waiting time for different numbers of segments, confirming again the optimality of "nondoubling" in some relevant parameter regimes. Thus, our approach provides the minimal possible waiting time of quantum repeaters in a fairly general physical setting.

Analysis and Optimization of Certain Parallel Monte Carlo Methods in the Low Temperature Limit

Metastability is a formidable challenge to Markov chain Monte Carlo methods. In this paper we present methods for algorithm design to meet this challenge. The design problem we consider is temperature selection for the infinite swapping scheme, which is the limit of the widely used parallel tempering scheme obtained when the swap rate tends to infinity. We use a recently developed tool for the analysis of the empirical measure of a small noise diffusion to transform the variance reduction problem into an explicit optimization problem. Our first analysis of the optimization problem is in the setting of a double-well model, and it shows that the optimal selection of temperature ratios is a geometric sequence except possibly the highest temperature. In the same setting we identify two different sources of variance reduction and show how their competition determines the optimal highest temperature. In the general multiwell setting we prove that the same geometric sequence of temperature ratios as in the two-well case is always nearly optimal, with a performance gap that decays geometrically in the number of temperatures.

A 16-Bit Calibration-Free SAR ADC With Binary-Window and Capacitor-Swapping DAC Switching Schemes

This paper presents a 16-bit successive approximation register analog-to-digital converter (ADC) achieving over-100 dB spurious-free dynamic range (SFDR). This ADC uses V_CM-based and binary-window digital-to-analog converter (DAC) switching schemes to improve the signal-to-noise and distortion ratio (SNDR). Moreover, a <i>level-2</i> capacitor swapping scheme is proposed to achieve superior DAC linearity by using two intrinsic true random number sequences. A prototype ADC is fabricated in 180 nm CMOS technology and occupies an active area of 0.53 mm². At 1 MS/s, it consumes a total power of 1.05 mW from a supply of 1.8 V. The measured differential and integral nonlinearity are &#x2212;0.65/&#x002B;0.45 and &#x2212;2.2/&#x002B;2.1 least significant bit. With an input of 1 kHz, the measured SNDR and SFDR are 83 dB and 100 dB. The effective number of bits is 13.5, which is equivalent to a Schreier figure-of-merit of 169.8 dB.

Supporting Swap in Real-Time Task Scheduling for Unified Power-Saving in CPU and Memory

As the size of data grows rapidly in modern IoT (Internet-of-Things) and CPS (Cyber-Physical System) applications, the memory power consumption of real-time embedded systems increases dramatically. Unlike general-purpose systems where memory consumes about 10&#x0025; of the CPU power consumption, modern real-time systems have the memory power of 20&#x2013;50&#x0025; of CPU power. This is because the memory size of a real-time system should be large enough to accommodate the entire task set, and thus DRAM refresh operations become a major source of power consumption. In this article, we present a new swap scheme for real-time systems, which aims at reducing memory power consumption. To support swap with real-time constraints, we adopt high-speed NVM storage and co-optimize power-savings in CPU and memory. Unlike traditional real-time task models that only consider the executions in CPU, we define an extended task model that characterizes memory and storage paths of tasks as well, and tightly evaluate the worst-case execution time by formulating the overlapped latency between CPU and memory. By optimizing the CPU supply voltage and the memory swap ratio of given task set, our scheme reduces the energy consumption of real-time systems by 31.1&#x0025; on average under various workload conditions.

Proposal for practical multidimensional quantum networks

A Quantum Internet, i.e., a global interconnection of quantum devices, is the long term goal of quantum communications, and has so far been based on two-dimensional systems (qubits). Recent years have seen a significant development of high-dimensional quantum systems (qudits). While qudits present higher photon information efficiency and robustness to noise, their use in quantum networks present experimental challenges due to the impractical resources required in high-dimensional quantum repeaters. Here, we show that such challenges can be met via the use of standard quantum optical resources, such as weak coherent states or weak squeezed states, and linear optics. We report a concrete design and simulations of an entanglement swapping scheme for three and four dimensional systems, showing how the network parameters can be tuned to optimize secret key rates and analysing the enhanced noise robustness at different dimensions. Our work significantly simplifies the implementation of high-dimensional quantum networks, fostering their development with current technology.

Entanglement swapping for Bell states and Greenberger–Horne–Zeilinger states in qubit systems

We introduce a class of two-level multi-particle Greenberger–Horne–Zeilinger (GHZ) states, and study entanglement swapping between two systems for Bell states and the class of GHZ states in qubit systems, respectively. We give the formulas for the entanglement swapping of Bell states and GHZ states in any number of qubit systems. We further consider entanglement swapping between any number of Bell states and between any number of the introduced GHZ states, and propose a series of entanglement swapping schemes in a detailed way. We illustrate the applications of such schemes in quantum information processing by proposing quantum protocols for quantum key distribution, quantum secret sharing and quantum private comparison.

Research on Optimization Control Strategy of Vehicle-Road-Grid Charging and Exchanging Based on User Demand Guidance

Considering the time-space uncertainty of electric vehicle charging and changing demand, the uneven distribution and random diversity of charging stations, the big data cloud network is used to realize the real-time information interaction between charging and changing power station and electric vehicle. Based on the user demand orientation, an intelligent charging and changing optimization control strategy of “Vehicle-Road-Grid” integrating cloud vehicle operation data is proposed. Under the discrete electric vehicle charging demand, this strategy quickly organizes the supply information around the discrete point. On the basis of the minimum energy consumption between the electric vehicle charging request point and the supply point, considering the multi-dimensional factors such as the optimal interests of the electric vehicle users, the shortest waiting time for charging and changing, and the shortest driving distance for charging and changing, the multi-objective optimal configuration strategy is realized. The simulation results show that the strategy can stably select the charging and swapping scheme that best meets the actual needs of users, effectively improve the charging and swapping service experience of users, and enhance the adhesion and participation of users.

Self-Adapting Channel Allocation for Multiple Tenants Sharing SSD Devices

Solid-state drives (SSDs) have been widely deployed in high-performance data center environments, where multiple tenants usually share the same hardware. However, traditional SSDs distribute the users&#x2019; incoming data uniformly across all SSD channels, which leads to numerous access conflicts. Meanwhile, SSDs that blindly allocate one or several channels to one tenant sacrifice device parallelism and capacity. When SSDs are shared by tenants with different access patterns, inappropriate channel allocation results in SSD performance degradation. In this article, we propose a self-adapting channel allocation mechanism, named SSDKeeper, for multiple tenants that share one SSD. SSDKeeper employs a machine learning-assisted algorithm to take full advantage of SSD parallelism while providing performance isolation. By collecting multitenant access patterns, SSDKeeper predicts an optimal channel allocation strategy for multiple tenants using the well-trained model. To further consume the blocks in different channels evenly, SSDKeeper equips with a novel channel swap scheme to prolong the SSD lifespan. Comparing with traditional SSDs, SSDKeeper reduces the overall latency of read and write by 12.6&#x0025; and the lifespan is prolonged up to <inline-formula> <tex-math notation="LaTeX">$3.7\times $ </tex-math></inline-formula>.