Robustness of two-qubit and three-qubit states in correlated quantum channels

We investigate how the correlated actions of quantum channels affect the robustness of entangled states. We consider the Bell-like state and random two-qubit pure states in the correlated depolarizing, bit flip, bit-phase flip, and phase flip channels. It is found that the robustness of two-qubit pure states can be noticeably enhanced due to the correlations between consecutive actions of these noisy channels, and the Bell-like state is always the most robust state. We also consider the robustness of three-qubit pure states in correlated noisy channels. For the correlated bit flip and phase flip channels, the result shows that although the most robust and most fragile states are locally unitary equivalent, they exhibit different robustness in different correlated channels, and the effect of channel correlations on them is also significantly different. However, for the correlated depolarizing and bit-phase flip channels, the robustness of two special three-qubit pure states is exactly the same. Moreover, compared with the random three-qubit pure states, they are neither the most robust states nor the most fragile states.

The Efficient Preparation of Normal Distributions in Quantum Registers

The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation of arbitrary normal distributions in quantum registers. To the best of our knowledge, our work is the first to leverage the power of Mid-Circuit Measurement and Reuse (MCMR), in a way that is broadly applicable to a range of state-preparation problems. Specifically, our algorithm employs a repeat-until-success scheme, and only requires a constant-bounded number of repetitions in expectation. In the experiments presented, the use of MCMR enables up to a 862.6x reduction in required qubits. Furthermore, the algorithm is provably resistant to both phase-flip and bit-flip errors, leading to a first-of-its-kind empirical demonstration on real quantum hardware, the MCMR-enabled Honeywell System Models H0 and H1-2.

Robustness of multipartite entangled states for fermionic systems under noisy channels in non-inertial frames

We investigate robustness of bipartite and tripartite entangled states for fermionic systems in non-inertial frames, which are under noisy channels. We consider two Bell states and two Greenberger-Horne-Zeilinger (GHZ) states, which possess initially the same amount of entanglement, respectively. By using genuine multipartite (GM) concurrence, we analytically derive the equations that determine the difference between the robustness of these locally unitarily equivalent states under the amplitude-damping channel. We find that tendency of the robustness for two GHZ states evaluated by using three-tangle τ and GM concurrence as measures of genuine tripartite entanglement is equal to each other. We also find that the robustness of two Bell states is equal to each other under the depolarizing, phase damping and bit flip channels, and that the same is true for two GHZ states.

Analysis of Decoherence in Linear and Cyclic Quantum Walks

We theoretically analyze the case of noisy Quantum walks (QWs) by introducing four qubit decoherence models into the coin degree of freedom of linear and cyclic QWs. These models include flipping channels (bit flip, phase flip and bit-phase flip), depolarizing channel, phase damping channel and generalized amplitude damping channel. Explicit expressions for the probability distribution of QWs on a line and on a cyclic path are derived under localized and delocalized initial states. We show that QWs which begin from a delocalized state generate mixture probability distributions, which could give rise to useful algorithmic applications related to data encoding schemes. Specifically, we show how the combination of delocalzed initial states and decoherence can be used for computing the binomial transform of a given set of numbers. However, the sensitivity of QWs to noisy environments may negatively affect various other applications based on QWs.

Routing Density Analysis of Area-Efficient Ring Oscillator Physically Unclonable Functions

The research into ring oscillator physically unclonable functions (RO-PUF) continues to expand due to its simple structure, ease of generating responses, and its promises of primitive security. However, a substantial study has yet to be carried out in developing designs of the FPGA-based RO-PUF, which effectively balances performance and area efficiency. This work proposes a modified RO-PUF where the ring oscillators are connected directly to the counters. The proposed RO-PUF requires fewer RO than the conventional structure since this work utilizes the direct pulse count method. This work aims to seek the ideal routing density of ROs to improve uniqueness. For this purpose, five logic arrangements of a wide range of routing densities of ROs were tested. Upon implementation onto the FPGA chip, the routing density of ROs are varied significantly in terms of wire utilization (higher than 25%) and routing hotspots (higher than 80%). The best uniqueness attained was 52.71%, while the highest reliability was 99.51%. This study improves the uniqueness by 2% subsequent to the application of scenarios to consider ROs with a narrow range of routing density. The best range of wire utilization and routing hotspots of individual RO in this work is 3–5% and 20–50%, respectively. The performance metrics (uniqueness and reliability) of the proposed RO-PUF are much better than existing works using a similar FPGA platform (Altera), and it is as good as the recent RO-PUFs realized on Xilinx. Additionally, this work estimates the minimum runtimes to reduce error and response bit-flip of RO-PUF.

Universal gates with wires in a row

We give some optimal size generating sets for the group generated by shifts and local permutations on the binary full shift. We show that a single generator, namely the fully asynchronous application of the elementary cellular automaton 57 (or, by symmetry, ECA 99), suffices in addition to the shift. In the terminology of logical gates, we have a single reversible gate whose shifts generate all (finitary) reversible gates on infinitely many binary-valued wires that lie in a row and cannot (a priori) be rearranged. We classify pairs of words u, v such that the gate swapping these two words, together with the shift and the bit flip, generates all local permutations. As a corollary, we obtain analogous results in the case where the wires are arranged on a cycle, confirming a conjecture of Macauley-McCammond-Mortveit and Vielhaber.