A Secure Scheme Based on a Hybrid of Classical-Quantum Communications Protocols for Managing Classical Blockchains.

Blockchain technology affords data integrity protection and building trust mechanisms in transactions for distributed networks, and, therefore, is seen as a promising revolutionary information technology. At the same time, the ongoing breakthrough in quantum computation technology contributes toward large-scale quantum computers, which might attack classic cryptography, seriously threatening the classic cryptography security currently employed in the blockchain. As a better alternative, a quantum blockchain has high expectations of being immune to quantum computing attacks perpetrated by quantum adversaries. Although several works have been presented, the problems of impracticality and inefficiency in quantum blockchain systems remain prominent and need to be addressed. First, this paper develops a quantum-secure blockchain (QSB) scheme by introducing a consensus mechanism-quantum proof of authority (QPoA) and an identity-based quantum signature (IQS)-wherein QPoA is used for new block generation and IQS is used for transaction signing and verification. Second, QPoA is developed by adopting a quantum voting protocol to achieve secure and efficient decentralization for the blockchain system, and a quantum random number generator (QRNG) is deployed for randomized leader node election to protect the blockchain system from centralized attacks like distributed denial of service (DDoS). Compared to previous work, our scheme is more practical and efficient without sacrificing security, greatly contributing to better addressing the challenges in the quantum era. Extensive security analysis demonstrates that our scheme provides better protection against quantum computing attacks than classic blockchains. Overall, our scheme presents a feasible solution for blockchain systems against quantum computing attacks through a quantum strategy, contributing toward quantum-secured blockchain in the quantum era.

The secure judgment of graphic similarity against malicious adversaries and its applications.

With the advent of the era of big data, privacy computing analyzes and calculates data on the premise of protecting data privacy, to achieve data 'available and invisible'. As an important branch of secure multi-party computation, the geometric problem can solve practical problems in the military, national defense, finance, life, and other fields, and has important research significance. In this paper, we study the similarity problem of geometric graphics. First, this paper proposes the adjacency matrix vector coding method of isomorphic graphics, and use the Paillier variant encryption cryptography to solve the problem of isomorphic graphics confidentiality under the semi-honest model. Using cryptography tools such as elliptic curve cryptosystem, zero-knowledge proof, and cut-choose method, this paper designs a graphic similarity security decision protocol that can resist malicious adversary attacks. The analysis shows that the protocol has high computational efficiency and has wide application value in terrain matching, mechanical parts, biomolecules, face recognition, and other fields.

Splitting an Arbitrary Three-Qubit State via a Five-Qubit Cluster State and a Bell State.

Quantum information splitting (QIS) provides an idea for transmitting the quantum state through a classical channel and a preshared quantum entanglement resource. This paper presents a new scheme for QIS based on a five-qubit cluster state and a Bell state. In this scheme, the sender transmits the unknown three-qubit secret state to two agents by the quantum channel with the Bell basis measurement three times and broadcasts the measurement results to the agents through the classical channel. The agent who restores the secret state can successfully recover the initial information to be transmitted through the appropriate unitary operation with the help of the other party. Firstly, our scheme's process can be accurately realized by performing the applicable Bell basis measurement, single-qubit measurement, and local unitary operation instead of a multiparticle joint measurement. The splitting process of quantum information is realized through a convenient operation. Secondly, compared with some previous schemes, the efficiency of the total scheme has been improved in principle, and the qubit consumption is reduced. Finally, the security of the quantum information splitting scheme is analyzed from the perspectives of external attacks and participant attacks. It is proved that our scheme can effectively resist internal participant attacks and external eavesdropper attacks.

Asymmetric controlled bidirectional remote preparation of two- and three-qubit equatorial state.

In this paper, a novel asymmetric controlled bidirectional remote preparation scheme is proposed. In our scheme, Alice and Bob are not only the senders but also the receivers with the control of Charlie. By using the eleven-qubit entangled state as the quantum channel, Alice prepares an arbitrary two-qubit equatorial state for Bob and Bob prepares an arbitrary three-qubit equatorial state for Alice simultaneously. Firstly, we give the construction process of the quantum channel. Secondly, the whole recovery operations are given. Alice and Bob can recover the prepared state determinately. Thirdly, we consider the effect of the noisy environment (amplitude-damping and phase-damping) in our scheme and calculate the fidelities of the output states. Finally, since our scheme does not need additional operations and auxiliary qubits, the efficiency of our scheme is higher than that of the previous schemes.

Exploring the effect of N308D mutation on protein tyrosine phosphatase-2 cause gain-of-function activity by a molecular dynamics study.

One of the most common protein tyrosine phosphatase-2 (SHP2) mutations in Noonan syndrome is the N308D mutation, and it increases the activity of the protein. However, the molecular basis of the activation of N308D mutation on SHP2 conformations is poorly understood. Here, molecular dynamic simulations were performed on SHP2 and SHP2-N308D to explore the effect of N308D mutation on SHP2 cause gain of function activity, respectively. The principal component analysis, dynamic cross-correlation map, secondary structure analysis, residue interaction networks, and solvent accessible surface area analysis suggested that the N308D mutation distorted the residues interactions network between the allosteric site (residue Gly244-Gly246) and C-SH2 domain, including the hydrogen bond formation and the binding energy. Meanwhile, the activity of catalytic site (residue Gly503-Val505) located in the Q-loop in mutant increased due to this region's high fluctuations. Therefore, the substrate had more chances to access to the catalytic activity site of the precision time protocol domain of SHP2-N308D, which was easy to be exposed. In addition, we had speculated that the Lys244 located in the allosteric site was the key residue which lead to the protein conformation changes. Consequently, overall calculations presented in this study ultimately provide a useful understanding of the increased activity of SHP2 caused by the N308D mutation.

Synthesis and biological evaluation of novel N-aryl-ω-(benzoazol-2-yl)-sulfanylalkanamides as dual inhibitors of α-glucosidase and protein tyrosine phosphatase 1B.

α-Glucosidase is known to catalyze the digestion of carbohydrates and release free glucose into the digestive tract. Protein tyrosine phosphatase 1B (PTP1B) is engaged in the dephosphorylation of the insulin receptor and regulation of insulin sensitivity. Therefore, dual antagonists by targeting both α-glucosidase and PTP1B may be potential candidates for type 2 diabetes therapy. In this work, three series of novel N-aryl-ω-(benzoazol-2-yl)-sulfanylalkanamides were synthesized and assayed for their α-glucosidase and PTP1B inhibitory activities, respectively. Compound 3l, exhibiting the most effective α-glucosidase inhibitory activity (IC50  = 10.96 µm (3l), IC50  = 51.32 µm (Acarbose), IC50  = 18.22 µm (Ursolic acid)) and potent PTP1B inhibitory activity (IC50  = 13.46 µm (3l), IC50  = 14.50 µm (Ursolic acid)), was identified as a novel dual inhibitor of α-glucosidase and PTP1B. Furthermore, 3l is a highly selective PTP1B inhibitor because no inhibition was showed by 3l at 100 µm against PTP-MEG2, TCPTP, SHP2, or SHP1. Subsequent kinetic analysis revealed 3l inhibited α-glucosidase in a reversible and mixed manner. Molecular docking study indicated that hydrogen bonds, van der Waals, charge interactions and Pi-cation interactions all contributed to affinity between 3l and α-glucosidase/PTP1B.

Erratum: RETRACTION: Efficient Quantum Transmission in Multiple-Source Networks.

This corrects the article DOI: 10.1038/srep07627.

3D QSAR Pharmacophore Based Virtual Screening for Identification of Potential Inhibitors for CDC25B.

Owing to its fundamental roles in cell cycle phases, the cell division cycle 25B (CDC25B) was broadly considered as potent clinical drug target for cancers. In this study, 3D QSAR pharmacophore models for CDC25B inhibitors were developed by the module of Hypogen. Three methods (cost analysis, test set prediction, and Fisher's test) were applied to validate that the models could be used to predict the biological activities of compounds. Subsequently, 26 compounds satisfied Lipinski's rule of five were obtained by the virtual screening of the Hypo-1-CDC25B against ZINC databases. It was then discovered that 9 identified molecules had better binding affinity than a known CDC25B inhibitors-compound 1 using docking studies. The molecular dynamics simulations showed that the compound had favorable conformations for binding to the CDC25B. Thus, our findings here would be helpful to discover potent lead compounds for the treatment of cancers.

Intestinal absorption of pallidifloside D are limited by P-glycoprotein in mice.

1. Pallidifloside D, a saponin glycoside constituent from the total saponins of Smilax riparia, had been proved to be very effective in hyperuricemic control. But it is poorly bioavailable after oral administration. Here, we determined the role of P-glycoprotein (P-gp) in the intestinal absorption of Pallidifloside D. 2. We found that Pallidifloside D significantly stimulated P-gp ATPase activity in vitro ATPase assay with a small EC50 value of 0.46 µM. 3. In the single-pass perfused mouse intestine model, the absorption of Pallidifloside D was not favored in the small intestine (duodenum, jejunum and ileum) with a P*w value of 0.35-0.78. By contrast, this compound was well-absorbed in the colon with a P*w value of 1.23. The P-gp inhibitors cyclosporine significantly enhanced Pallidifloside D absorption in all four intestinal segments (duodenum, jejunum, ileum and colon) and the fold change ranged from 5.5 to 15.3. Pharmacokinetic study revealed that cyclosporine increased the systemic exposure of Pallidifloside D by a 2.5-fold after oral administration. 4. These results suggest that P-gp-mediated efflux is a limiting factor for intestinal absorption of Pallidifloside D in mice.

The solvability of quantum k-pair network in a measurement-based way.

Network coding is an effective means to enhance the communication efficiency. The characterization of network solvability is one of the most important topic in this field. However, for general network, the solvability conditions are still a challenge. In this paper, we consider the solvability of general quantum k-pair network in measurement-based framework. For the first time, a detailed account of measurement-based quantum network coding(MB-QNC) is specified systematically. Differing from existing coding schemes, single qubit measurements on a pre-shared graph state are the only allowed coding operations. Since no control operations are concluded, it makes MB-QNC schemes more feasible. Further, the sufficient conditions formulating by eigenvalue equations and stabilizer matrix are presented, which build an unambiguous relation among the solvability and the general network. And this result can also analyze the feasibility of sharing k EPR pairs task in large-scale networks. Finally, in the presence of noise, we analyze the advantage of MB-QNC in contrast to gate-based way. By an instance network [Formula: see text], we show that MB-QNC allows higher error thresholds. Specially, for X error, the error threshold is about 30% higher than 10% in gate-based way. In addition, the specific expressions of fidelity subject to some constraint conditions are given.

The design of novel inhibitors for treating cancer by targeting CDC25B through disruption of CDC25B-CDK2/Cyclin A interaction using computational approaches.

Cell division cycle 25B is a key cell cycle regulator and widely considered as potent clinical drug target for cancers. This research focused on identifying potential compounds in theory which are able to disrupt transient interactions between CDC25B and its CDK2/Cyclin A substrate.By using the method of ZDOCK and RDOCK, the most optimized 3D structure of CDK2/Cyclin A in complex with CDC25B was constructed and validated using two methods: 1) the superimposition of proteins; 2) analysis of the hydrogen bond distances of Arg 488(N1)-Asp 206(OD1), Arg 492(NE)-Asp 206(OD1), Arg 492(N1)-Asp 206(OD2) and Tyr 497(NE)-Asp 210(OD1). A series of new compounds was gained through searching the fragment database derived from ZINC based on the known inhibitor-compound 7 by the means of "replace fragment" technique. The compounds acquired via meeting the requirements of the absorption, distribution, metabolism, and excretion (ADME) predictions. Finally, 12 compounds with better binding affinity were identified. The comp#1, as a representative, was selected to be synthesized and assayed for their CDC25B inhibitory activities. The comp#1 exhibited mild inhibitory activities against human CDC25B with IC50 values at about 39.02 µM. Molecular Dynamic (MD) simulation revealed that the new inhibitor-comp#1 had favorable conformations for binding to CDC25B and disturbing the interactions between CDC25B and CDK2/Cyclin A.

A kind of universal quantum secret sharing protocol.

Universality is an important feature, but less researched in quantum communication protocols. In this paper, a kind of universal quantum secret sharing protocol is investigated. Firstly, we design a quantum secret sharing protocol based on the Borras-Plastino-Batle (BPB) state. Departing from previous research, our protocol has a salient feature in that participants in our protocol only need projective measurement instead of any unitary operations. It makes our protocol more flexible. Secondly, universality of quantum communication protocols is studied for the first time. More specifically, module division of quantum communication protocols and coupling between different modules are discussed. Our aforementioned protocol is analyzed as an example. On one hand, plenty of quantum states (the BPB-class states and the BPB-like-class states, which are proposed in this paper) could be used as carrier to perform our protocol. On the other hand, our protocol also could be regarded as a quantum private comparison protocol with a little revision. These features are rare for quantum communication protocols, and make our protocol more robust. Thirdly, entanglements of the BPB-class states are calculated in the Appendix.

Practical Quantum Private Database Queries Based on Passive Round-Robin Differential Phase-shift Quantum Key Distribution.

A novel quantum private database query protocol is proposed, based on passive round-robin differential phase-shift quantum key distribution. Compared with previous quantum private database query protocols, the present protocol has the following unique merits: (i) the user Alice can obtain one and only one key bit so that both the efficiency and security of the present protocol can be ensured, and (ii) it does not require to change the length difference of the two arms in a Mach-Zehnder interferometer and just chooses two pulses passively to interfere with so that it is much simpler and more practical. The present protocol is also proved to be secure in terms of the user security and database security.

Hybrid Toffoli gate on photons and quantum spins.

Quantum computation offers potential advantages in solving a number of interesting and difficult problems. Several controlled logic gates, the elemental building blocks of quantum computer, have been realized with various physical systems. A general technique was recently proposed that significantly reduces the realization complexity of multiple-control logic gates by harnessing multi-level information carriers. We present implementations of a key quantum circuit: the three-qubit Toffoli gate. By exploring the optical selection rules of one-sided optical microcavities, a Toffoli gate may be realized on all combinations of photon and quantum spins in the QD-cavity. The three general controlled-NOT gates are involved using an auxiliary photon with two degrees of freedom. Our results show that photons and quantum spins may be used alternatively in quantum information processing.

Synthesis, biological evaluation and 3D-QSAR studies of imidazolidine-2,4-dione derivatives as novel protein tyrosine phosphatase 1B inhibitors.

Protein tyrosine phosphatase 1B (PTP1B) plays a vital role in the regulation of insulin sensitivity and dephosphorylation of the insulin receptor, so PTP1B inhibitors may be potential agents to treat type 2 diabetes. In this work, a series of novel imidazolidine-2,4-dione derivatives were designed, synthesized and assayed for their PTP1B inhibitory activities. These compounds exhibited potent activities with IC50 values at 0.57-172 µM. A 3D-QSAR study using CoMFA and CoMSIA techniques was carried out to explore structure activity relationship of these molecules. The CoMSIA model was more predictive with q(2) = 0.777, r(2) = 0.999, SEE = 0.013 and r(2)pred = 0.836, while the CoMFA model gave q(2) = 0.543, r(2) = 0.998, SEE = 0.029 and r(2)pred = 0.754. The contour maps derived from the best CoMFA and CoMSIA models combined with docking analysis provided good insights into the structural features relevant to the bioactivity, and could be used in the molecular design of novel imidazolidine-2,4-dione derivatives.

Controlled Photon Switch Assisted by Coupled Quantum Dots.

Quantum switch is a primitive element in quantum network communication. In contrast to previous switch schemes on one degree of freedom (DOF) of quantum systems, we consider controlled switches of photon system with two DOFs. These controlled photon switches are constructed by exploring the optical selection rules derived from the quantum-dot spins in one-sided optical microcavities. Several double controlled-NOT gate on different joint systems are greatly simplified with an auxiliary DOF of the controlling photon. The photon switches show that two DOFs of photons can be independently transmitted in quantum networks. This result reduces the quantum resources for quantum network communication.

Efficient quantum transmission in multiple-source networks.

A difficult problem in quantum network communications is how to efficiently transmit quantum information over large-scale networks with common channels. We propose a solution by developing a quantum encoding approach. Different quantum states are encoded into a coherent superposition state using quantum linear optics. The transmission congestion in the common channel may be avoided by transmitting the superposition state. For further decoding and continued transmission, special phase transformations are applied to incoming quantum states using phase shifters such that decoders can distinguish outgoing quantum states. These phase shifters may be precisely controlled using classical chaos synchronization via additional classical channels. Based on this design and the reduction of multiple-source network under the assumption of restricted maximum-flow, the optimal scheme is proposed for specially quantized multiple-source network. In comparison with previous schemes, our scheme can greatly increase the transmission efficiency.

Geometry of quantum computation with qudits.

The circuit complexity of quantum qubit system evolution as a primitive problem in quantum computation has been discussed widely. We investigate this problem in terms of qudit system. Using the Riemannian geometry the optimal quantum circuits are equivalent to the geodetic evolutions in specially curved parametrization of SU(d(n)). And the quantum circuit complexity is explicitly dependent of controllable approximation error bound.