Mechanism of Universal Quantum Computation in the Brain

In this paper, the authors extend [1] and provide more details of how the brain may act like a quantum computer. In particular, positing the difference between voltages on two axons as the environment for ions undergoing spatial superposition, we argue that evolution in the presence of metric perturbations will differ from that in the absence of these waves. This differential state evolution will then encode the information being processed by the tract due to the interaction of the quantum state of the ions at the nodes with the “controlling’ potential. Upon decoherence, which is equal to a measurement, the final spatial state of the ions is decided and it also gets reset by the next impulse initiation time. Under synchronization, several tracts undergo such processes in synchrony and therefore the picture of a quantum computing circuit is complete. Under this model, based on the number of axons in the corpus callosum alone, we estimate that upwards of 50 million quantum states might be prepared and evolved every second in this white matter tract, far greater processing than any present quantum computer can accomplish.

A Novel Scheduling Framework for Multi-Programming Quantum Computing in Cloud Environment

As cloud quantum computing gains broader acceptance,a growing quantity of researchers are directing their focus towards this domain.Nevertheless,the rapid surge in demand for cloud-based quantum computing resources has led to a scarcity,which in turn hampers users from achieving optimal satisfaction.Therefore,cloud quantum computing service providers require a unified analysis and scheduling framework for their quantumresources and user jobs to meet the ever-growing usage demands.This paper introduces a new multi-programming scheduling framework for quantum computing in a cloud environment.The framework addresses the issue of limited quantum computing resources in cloud environments and ensures a satisfactory user experience.It introduces three innovative designs:1)Our framework automatically allocates tasks to different quantum backends while ensuring fairness among users by considering both the cloud-based quantum resources and the user-submitted tasks.2)Multi-programming mechanism is employed across different quantum backends to enhance the overall throughput of the quantum cloud.In comparison to conventional task schedulers,our proposed framework achieves a throughput improvement of more than two-fold in the quantum cloud.3)The framework can balance fidelity and user waiting time by adaptively adjusting scheduling parameters.

Tackling the Existential Threats from Quantum Computers and AI

Although AI and quantum computing (QC) are fast emerging as key enablers of the future Internet, experts believe they pose an existential threat to humanity. Responding to the frenzied release of ChatGPT/GPT-4, thousands of alarmed tech leaders recently signed an open letter to pause AI research to prepare for the catastrophic threats to humanity from uncontrolled AGI (Artificial General Intelligence). Perceived as an “epistemological nightmare”, AGI is believed to be on the anvil with GPT-5. Two computing rules appear responsible for these risks. 1) Mandatory third-party permissions that allow computers to run applications at the expense of introducing vulnerabilities. 2) The Halting Problem of Turing-complete AI programming languages potentially renders AGI unstoppable. The double whammy of these inherent weaknesses remains invincible under the legacy systems. A recent cybersecurity breakthrough shows that banning all permissions reduces the computer attack surface to zero, delivering a new zero vulnerability computing (ZVC) paradigm. Deploying ZVC and blockchain, this paper formulates and supports a hypothesis: “Safe, secure, ethical, controllable AGI/QC is possible by conquering the two unassailable rules of computability.” Pursued by a European consortium, testing/proving the proposed hypothesis will have a groundbreaking impact on the future digital infrastructure when AGI/QC starts powering the 75 billion internet devices by 2025.

Defining Quantum Advantage for Building a Sustainable MVP to Deliver Quantum Computing Services

Quantum Computing (QC) is hailed as the future of computers. After Google’s claim of achieving Quantum Supremacy in 2019, several groups challenged the claim. Some QC experts attribute catastrophic risks that unrestrained QC may cause in the future by collapsing the current cryptographic cybersecurity infrastructure. These predictions are relevant only if QC becomes commercially viable and sustainable in the future. No technology can be a one-way ticket to catastrophe, and neither can the definition of superiority of that technology be. If there are catastrophic risks, large-scale QC can never enter the public domain as a minimum viable product (MVP) unless there are safeguards in place. Those safeguards should obviously become an integral part of the definition of its superiority over the legacy systems. NIST (National Institute of Standards & Technology) is pursuing the standardization of Post Quantum Cryptography (PQC) as that safeguard. However, with all the 82 candidate PQCs failing and companies already offering QC as a service, there’s an urgent need for an alternate strategy to mitigate the impending Q-Day threat and render QC sustainable. Our research proposes a novel encryption-agnostic cybersecurity approach to safeguard QC. It articulates a comprehensive definition of an MVP that can potentially set a sustainable gold standard for defining commercially viable quantum advantage over classical computing.

Simulation of Projective Non-Abelian Anyons for Quantum Computation

Fundamental particles in nature can be classified as bosons or fermions,which satisfy their correspondent statistics.However,quasiparticles of condensed matter physics may be neither bosons nor fermions,but can be named as anyons satisfying a generalized statistics.These anyons can be related with topological phases of matter.Interestingly,anyons can be used to encode qubits to perform quantum computations with specific advantages in which the corresponding qubits are naturally fault tolerant due to topological protection.[1,2]This approach is called topological quantum computation.However,its implementation based on natural systems still seems far from realization.

Blind quantum computation with a client performing different single-qubit gates

In the field of single-server blind quantum computation(BQC), a major focus is to make the client as classical as possible. To achieve this goal, we propose two single-server BQC protocols to achieve verifiable universal quantum computation. In these two protocols, the client only needs to perform either the gate T(in the first protocol) or the gates H and X(in the second protocol). With assistance from a single server, the client can utilize his quantum capabilities to generate some single-qubit states while keeping the actual state of these qubits confidential from others. By using these single-qubit states, the verifiable universal quantum computation can be achieved.

A concise review of Rydberg atom based quantum computation and quantum simulation

Quantum information processing based on Rydberg atoms emerged as a promising direction two decades ago.Recent experimental and theoretical progresses have shined exciting light on this avenue.In this concise review,we will briefly introduce the basics of Rydberg atoms and their recent applications in associated areas of neutral atom quantum computation and simulation.We shall also include related discussions on quantum optics with Rydberg atomic ensembles,which are increasingly used to explore quantum computation and quantum simulation with photons.

Quantum computation and error correction based on continuous variable cluster states

Measurement-based quantum computation with continuous variables,which realizes computation by performing measurement and feedforward of measurement results on a large scale Gaussian cluster state,provides a feasible way to implement quantum computation.Quantum error correction is an essential procedure to protect quantum information in quantum computation and quantum communication.In this review,we briefly introduce the progress of measurement-based quantum computation and quantum error correction with continuous variables based on Gaussian cluster states.We also discuss the challenges in the fault-tolerant measurement-based quantum computation with continuous variables.

Lorentz quantum computer

A theoretical model of computation is proposed based on Lorentz quantum mechanics.Besides the standard qubits,this model has an additional bit,which we call hyperbolic bit(or hybit in short).A set of basic logical gates are constructed and their universality is proved.As an application,a search algorithm is designed for this computer model and is found to be exponentially faster than Grover's search algorithm.

Quantum computation with two-dimensional graphene quantum dots

We study an array of graphene nano sheets that form a two-dimensional S = 1/2 Kagome spin lattice used for quantum computation. The edge states of the graphene nano sheets are used to form quantum dots to confine electrons and perform the computation. We propose two schemes of bang-bang control to combat decoherence and realize gate operations on this array of quantum dots. It is shown that both schemes contain a great amount of information for quantum computation. The corresponding gate operations are also proposed.

Universal quantum computation using all-optical hybrid encoding

By employing displacement operations, single-photon subtractions, and weak cross-Kerr nonlinearity, we propose an alternative way of implementing several universal quantum logical gates for all-optical hybrid qubits encoded in both single-photon polarization state and coherent state. Since these schemes can be straightforwardly implemented only using local operations without teleportation procedure, therefore, less physical resources and simpler operations are required than the existing schemes. With the help of displacement operations, a large phase shift of the coherent state can be obtained via currently available tiny cross-Kerr nonlinearity. Thus, all of these schemes are nearly deterministic and feasible under current technology conditions, which makes them suitable for large-scale quantum computing.

Quantum Computing Based Neural Networks for Anomaly Classification in Real-Time Surveillance Videos

For intelligent surveillance videos,anomaly detection is extremely important.Deep learning algorithms have been popular for evaluating realtime surveillance recordings,like traffic accidents,and criminal or unlawful incidents such as suicide attempts.Nevertheless,Deep learning methods for classification,like convolutional neural networks,necessitate a lot of computing power.Quantum computing is a branch of technology that solves abnormal and complex problems using quantum mechanics.As a result,the focus of this research is on developing a hybrid quantum computing model which is based on deep learning.This research develops a Quantum Computing-based Convolutional Neural Network(QC-CNN)to extract features and classify anomalies from surveillance footage.A Quantum-based Circuit,such as the real amplitude circuit,is utilized to improve the performance of the model.As far as my research,this is the first work to employ quantum deep learning techniques to classify anomalous events in video surveillance applications.There are 13 anomalies classified from the UCF-crime dataset.Based on experimental results,the proposed model is capable of efficiently classifying data concerning confusion matrix,Receiver Operating Characteristic(ROC),accuracy,Area Under Curve(AUC),precision,recall as well as F1-score.The proposed QC-CNN has attained the best accuracy of 95.65 percent which is 5.37%greater when compared to other existing models.To measure the efficiency of the proposed work,QC-CNN is also evaluated with classical and quantum models.

Full-Blind Delegating Private Quantum Computation

The delegating private quantum computation(DQC)protocol with the universal quantum gate set{X,Z,H,P,R,CNOT}was firstly proposed by Broadbent et al.[Broadbent(2015)],and then Tan et al.[Tan and Zhou(2017)]tried to put forward a half-blind DQC protocol(HDQC)with another universal set{H,P,CNOT,T}.However,the decryption circuit of Toffoli gate(i.e.T)is a little redundant,and Tan et al.’s protocol[Tan and Zhou(2017)]exists the information leak.In addition,both of these two protocols just focus on the blindness of data(i.e.the client’s input and output),but do not consider the blindness of computation(i.e.the delegated quantum operation).For solving these problems,we propose a full-blind DQC protocol(FDQC)with quantum gate set{H,P,CNOT,T},where the desirable delegated quantum operation,one of{H,P,CNOT,T},is replaced by a fixed sequence(H,P,CZ,CNOT,T)to make the computation blind,and the decryption circuit of Toffoli gate is also optimized.Analysis shows that our protocol can not only correctly perform any delegated quantum computation,but also holds the characteristics of data blindness and computation blindness.

Quantum Chemistry Based Computational Study on the Conformational Population of a Neodymium Neodecanoate Complex

The title complex is widely used as an efficient key component of Ziegler-Natta catalyst for stereospecific polymerization of dienes to produce synthetic rubbers. However, the quantitative structure-activity relationship（QSAR） of this kind of complexes is still not clear mainly due to the difficulties to obtain their geometric molecular structures through laboratory experiments. An alternative solution is the quantum chemistry calculation in which the comformational population shall be determined. In this study, ten conformers of the title complex were obtained with the function of molecular dynamics conformational search in Gabedit 2.4.8, and their geometry optimization and thermodynamics calculation were made with a Sparkle/PM7 approach in MOPAC 2012. Their Gibbs free energies at 1 atm. and 298.15 K were calculated. Population of the conformers was further calculated out according to the theory of Boltzmann distribution, indicating that one of the ten conformers has a dominant population of 77.13%.

Accelerating Quantum Computing Readiness: Risk Management and Strategies for Sectors

The potential impact of quantum computing on various industries such as finance, healthcare, cryptography, and transportation is significant;therefore, sectors face challenges in understanding where to start because of the complex nature of this technology. Starting early to explore what is supposed to be done is crucial for providing sectors with the necessary knowledge, tools, and processes to keep pace with rapid advancements in quantum computing. This article emphasizes the importance of consultancy and governance solutions that aid sectors in preparing for the quantum computing revolution. The article begins by discussing the reasons why sectors need to be prepared for quantum computing and emphasizes the importance of proactive preparation. It illustrates this point by providing a real-world example of a partnership. Subsequently, the article mentioned the benefits of quantum computing readiness, including increased competitiveness, improved security, and structured data. In addition, this article discusses the steps that various sectors can take to achieve quantum readiness, considering the potential risks and opportunities in industries. The proposed solutions for achieving quantum computing readiness include establishing a quantum computing office, contracting with major quantum computing companies, and learning from quantum computing organizations. This article provides the detailed advantages and disadvantages of each of these steps and emphasizes the need to carefully evaluate their potential drawbacks to ensure that they align with the sector’s unique needs, goals, and available resources. Finally, this article proposes various solutions and recommendations for sectors to achieve quantum-computing readiness.

The Future of Quantum Computer Advantage

As technological innovations in computers begin to advance past their limit (Moore’s law), a new problem arises: What computational device would emerge after the classical supercomputers reach their physical limitations? At this moment in time, quantum computers are at their starting stage and there are already some strengths and advantages when compared with modern, classical computers. In its testing period, there are a variety of ways to create a quantum computer by processes such as the trapped-ion and the spin-dot methods. Nowadays, there are many drawbacks with quantum computers such as issues with decoherence and scalability, but many of these issues are easily emended. Nevertheless, the benefits of quantum computers at the moment outweigh the potential drawbacks. These benefits include its use of many properties of quantum mechanics such as quantum superposition, entanglement, and parallelism. Using these basic properties of quantum mechanics, quantum computers are capable of achieving faster computational times for certain problems such as finding prime factors of an integer by using Shor’s algorithm. From the advantages such as faster computing times in certain situations and higher computing powers than classical computers, quantum computers have a high probability to be the future of computing after classical computers hit their peak.

Leveraging Quantum Computing for the Ising Model to Simulate Two Real Systems: Magnetic Materials and Biological Neural Networks (BNNs)

Quantum computing is a field with increasing relevance as quantum hardware improves and more applications of quantum computing are discovered. In this paper, we demonstrate the feasibility of modeling Ising Model Hamiltonians on the IBM quantum computer. We developed quantum circuits to simulate these systems more efficiently for both closed and open boundary Ising models, with and without perturbations. We tested these various geometries of systems in both 1-D and 2-D space to mimic two real systems: magnetic materials and biological neural networks (BNNs). Our quantum model is more efficient than classical computers, which can struggle to simulate large, complex systems of particles.

Quantum circuit-based proxy blind signatures:A novel approach and experimental evaluation on the IBM quantum cloud platform

This paper presents a novel approach to proxy blind signatures in the realm of quantum circuits,aiming to enhance security while safeguarding sensitive information.The main objective of this research is to introduce a quantum proxy blind signature(QPBS)protocol that utilizes quantum logical gates and quantum measurement techniques.The QPBS protocol is constructed by the initial phase,proximal blinding message phase,remote authorization and signature phase,remote validation,and de-blinding phase.This innovative design ensures a secure mechanism for signing documents without revealing the content to the proxy signer,providing practical security authentication in a quantum environment under the assumption that the CNOT gates are securely implemented.Unlike existing approaches,our proposed QPBS protocol eliminates the need for quantum entanglement preparation,thus simplifying the implementation process.To assess the effectiveness and robustness of the QPBS protocol,we conduct comprehensive simulation studies in both ideal and noisy quantum environments on the IBM quantum cloud platform.The results demonstrate the superior performance of the QPBS algorithm,highlighting its resilience against repudiation and forgeability,which are key security concerns in the realm of proxy blind signatures.Furthermore,we have established authentic security thresholds(82.102%)in the presence of real noise,thereby emphasizing the practicality of our proposed solution.

Threshold-independent method for single-shot readout of spin qubits in semiconductor quantum dots

The single-shot readout data process is essential for the realization of high-fidelity qubits and fault-tolerant quantum algorithms in semiconductor quantum dots. However, the fidelity and visibility of the readout process are sensitive to the choice of the thresholds and limited by the experimental hardware. By demonstrating the linear dependence between the measured spin state probabilities and readout visibilities along with dark counts, we describe an alternative threshold-independent method for the single-shot readout of spin qubits in semiconductor quantum dots. We can obtain the extrapolated spin state probabilities of the prepared probabilities of the excited spin state through the threshold-independent method. We then analyze the corresponding errors of the method, finding that errors of the extrapolated probabilities cannot be neglected with no constraints on the readout time and threshold voltage. Therefore, by limiting the readout time and threshold voltage, we ensure the accuracy of the extrapolated probability. We then prove that the efficiency and robustness of this method are 60 times larger than those of the most commonly used method. Moreover, we discuss the influence of the electron temperature on the effective area with a fixed external magnetic field and provide a preliminary demonstration for a single-shot readout of up to 0.7K/1.5T in the future.

Simulations of superconducting quantum gates by digital flux tuner for qubits

The interconnection bottleneck caused by limitations of cable number, inner space and cooling power of dilution refrigerators has been an outstanding challenge for building scalable superconducting quantum computers with the increasing number of qubits in quantum processors. To surmount such an obstacle, it is desirable to integrate qubits with quantum–classical interface(QCI) circuits based on rapid single flux quantum(RSFQ) circuits. In this work, a digital flux tuner for qubits(DFTQ) is proposed for manipulating flux of qubits as a crucial part of the interface circuit. A schematic diagram of the DFTQ is presented, consisting of a coarse tuning unit and a fine-tuning unit for providing magnetic flux with different precision to qubits. The method of using DFTQ to provide flux for gate operations is discussed from the optimization of circuit design and input signal. To verify the effectiveness of the method, simulations of a single DFTQ and quantum gates including a Z gate and an iSWAP gate with DFTQs are performed for flux-tunable transmons. The quantum process tomography corresponding to the two gates is also carried out to analyze the sources of gate error. The results of tomography show that the gate fidelities independent of the initial states of the Z gate and the iSWAP gate are 99.935% and 99.676%,respectively. With DFTQs inside, the QCI would be a powerful tool for building large-scale quantum computers.