Verification in quantum computations is crucial since quantum systems are extremely vulnerable to the environment.However,verifying directly the output of a quantum computation is difficult since we know that efficien...Verification in quantum computations is crucial since quantum systems are extremely vulnerable to the environment.However,verifying directly the output of a quantum computation is difficult since we know that efficiently simulating a large-scale quantum computation on a classical computer is usually thought to be impossible.To overcome this difficulty,we propose a self-testing system for quantum computations,which can be used to verify if a quantum computation is performed correctly by itself.Our basic idea is using some extra ancilla qubits to test the output of the computation.We design two kinds of permutation circuits into the original quantum circuit:one is applied on the ancilla qubits whose output indicates the testing information,the other is applied on all qubits(including ancilla qubits) which is aiming to uniformly permute the positions of all qubits.We show that both permutation circuits are easy to achieve.By this way,we prove that any quantum computation has an efficient self-testing system.In the end,we also discuss the relation between our self-testing system and interactive proof systems,and show that the two systems are equivalent if the verifier is allowed to have some quantum capacity.展开更多
Efficient implementation of fundamental matrix operations on quantum computers,such as matrix products and Hadamard operations,holds significant potential for accelerating machine learning algorithms.A critical prereq...Efficient implementation of fundamental matrix operations on quantum computers,such as matrix products and Hadamard operations,holds significant potential for accelerating machine learning algorithms.A critical prerequisite for quantum implementations is the effective encoding of classical data into quantum states.We propose two quantum computing frameworks for preparing the distinct encoded states corresponding to matrix operations,including the matrix product,matrix sum,matrix Hadamard product and division.Quantum algorithms based on the digital encoding computing framework are capable of implementing the matrix Hadamard operation with a time complexity of O(poly log(mn/ε))and the matrix product with a time complexity of O(poly log(mnl/ε)),achieving an exponential speedup in contrast to the classical methods of O(mn)and O(mnl).Quantum algorithms based on the analog-encoding framework are capable of implementing the matrix Hadamard operation with a time complexity of O(k_(1)√mn·poly log(mn/ε))and the matrix product with a time complexity of O(k_(2)√1·poly log(mnl/ε)),where k_(1)and k_(2)are coefficients correlated with the elements of the matrix,achieving a square speedup in contrast to the classical counterparts.As applications,we construct an oracle that can access the trace of a matrix within logarithmic time,and propose several algorithms to respectively estimate the trace of a matrix,the trace of the product of two matrices,and the trace inner product of two matrices within logarithmic time.展开更多
The increasing popularity of quantum computing has resulted in a considerable rise in demand for cloud quantum computing usage in recent years.Nevertheless,the rapid surge in demand for cloud-based quantum computing r...The increasing popularity of quantum computing has resulted in a considerable rise in demand for cloud quantum computing usage in recent years.Nevertheless,the rapid surge in demand for cloud-based quantum computing resources has led to a scarcity.In order to meet the needs of an increasing number of researchers,it is imperative to facilitate efficient and flexible access to computing resources in a cloud environment.In this paper,we propose a novel quantum computing paradigm,Virtual QPU(VQPU),which addresses this issue and enhances quantum cloud throughput with guaranteed circuit fidelity.The proposal introduces three innovative concepts:(1)The integration of virtualization technology into the field of quantum computing to enhance quantum cloud throughput.(2)The introduction of an asynchronous execution of circuits methodology to improve quantum computing flexibility.(3)The development of a virtual QPU allocation scheme for quantum tasks in a cloud environment to improve circuit fidelity.The concepts have been validated through the utilization of a self-built simulated quantum cloud platform.展开更多
As an important index to measure the degree of entanglement in quantum systems,concurrence plays an important role in practical research.In this paper,we study the concurrence between two qubits in triangular triple q...As an important index to measure the degree of entanglement in quantum systems,concurrence plays an important role in practical research.In this paper,we study the concurrence between two qubits in triangular triple quantum dot structure.Through calculation and simulation,it is found that concurrence is mainly affected by the interdot coupling strength t,Coulomb interactionU,temperature T,and electrode coupling G.Through comparative studies with parallel triple quantum dot structures,we demonstrate that the triangular geometry exhibits significantly enhanced concurrence under identical conditions.In addition,under the condition that concurrence exceeds 0.9,the functional relationship between t and U is obtained through simulation,which provides theoretical support for quantum dot regulation under high entanglement.Finally,we demonstrate the feasibility of implementing a three-qubit quantum gate,using the Toffoli gate as a representative example,under the condition that the triangular triple quantum dot system maintains high entanglement.展开更多
Classical computation of electronic properties in large-scale materials remains challenging.Quantum computation has the potential to offer advantages in memory footprint and computational scaling.However,general and v...Classical computation of electronic properties in large-scale materials remains challenging.Quantum computation has the potential to offer advantages in memory footprint and computational scaling.However,general and viable quantum algorithms for simulating large-scale materials are still limited.We propose and implement random-state quantum algorithms to calculate electronic-structure properties of real materials.Using a random state circuit on a small number of qubits,we employ real-time evolution with first-order Trotter decomposition and Hadamard test to obtain electronic density of states,and we develop a modified quantum phase estimation algorithm to calculate real-space local density of states via direct quantum measurements.Furthermore,we validate these algorithms by numerically computing the density of states and spatial distributions of electronic states in graphene,twisted bilayer graphene quasicrystals,and fractal lattices,covering system sizes from hundreds to thousands of atoms.Our results manifest that the random-state quantum algorithms provide a general and qubit-efficient route to scalable simulations of electronic properties in large-scale periodic and aperiodic materials.展开更多
The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreser...The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreserving computation.Classical MPC relies on cryptographic techniques such as homomorphic encryption,secret sharing,and oblivious transfer,which may become vulnerable in the post-quantum era due to the computational power of quantum adversaries.This study presents a review of 140 peer-reviewed articles published between 2000 and 2025 that used different databases like MDPI,IEEE Explore,Springer,and Elsevier,examining the applications,types,and security issues with the solution of Quantum computing in different fields.This review explores the impact of quantum computing on MPC security,assesses emerging quantum-resistant MPC protocols,and examines hybrid classicalquantum approaches aimed at mitigating quantum threats.We analyze the role of Quantum Key Distribution(QKD),post-quantum cryptography(PQC),and quantum homomorphic encryption in securing multiparty computations.Additionally,we discuss the challenges of scalability,computational efficiency,and practical deployment of quantumsecure MPC frameworks in real-world applications such as privacy-preserving AI,secure blockchain transactions,and confidential data analysis.This review provides insights into the future research directions and open challenges in ensuring secure,scalable,and quantum-resistant multiparty computation.展开更多
Reservoir engineering has been widely used in various quantum technologies.Based on a cavity-QED(quantum electrodynamics)model,we propose a potentially practical scheme using squeezed-vacuum reservoir engineering to o...Reservoir engineering has been widely used in various quantum technologies.Based on a cavity-QED(quantum electrodynamics)model,we propose a potentially practical scheme using squeezed-vacuum reservoir engineering to optimize the performance of a quantum battery(QB)located inside a cavity driven by a broadband squeezed laser,which acts as a squeezed-vacuum reservoir.Using the reduced master equation of the QB obtained via the adiabatic elimination method,we focus on the QB's charging dynamics under tunable squeezed reservoirs governed by parametrically controlled squeezing parameters,which dictate the efficiency of energy transfer and the extractable work(ergotropy)of the QB.We show that increasing the squeezing strength improves the charging rate and enables rapid energy transfer,whereas the steady-state energy of the QB saturates at specific values of the squeezing parameter.Notably,the ergotropy of the QB reaches its maximum at a critical squeezing strength and does not scale monotonically with the squeezing strength.This nonmonotonic behavior underscores the existence of optimal parameter regimes,through which the performance of the QB can be significantly enhanced.展开更多
In the 9 December 2024 issue of Nature[1],a team of Google engineers reported breakthrough results using“Willow”,their lat-est quantum computing chip(Fig.1).By meeting a milestone“below threshold”reduction in the ...In the 9 December 2024 issue of Nature[1],a team of Google engineers reported breakthrough results using“Willow”,their lat-est quantum computing chip(Fig.1).By meeting a milestone“below threshold”reduction in the rate of errors that plague super-conducting circuit-based quantum computing systems(Fig.2),the work moves the field another step towards its promised super-charged applications,albeit likely still many years away.Areas expected to benefit from quantum computing include,among others,drug discovery,materials science,finance,cybersecurity,and machine learning.展开更多
With a paper published in the 19 February 2025 issue of Nature[1],Microsoft(Redmond,WA,USA)fanned the flames of its unique vision for quantum computing:a stable,error-resistant qubit based on the Majorana fermion,one ...With a paper published in the 19 February 2025 issue of Nature[1],Microsoft(Redmond,WA,USA)fanned the flames of its unique vision for quantum computing:a stable,error-resistant qubit based on the Majorana fermion,one of the strangest and most elusive particles in physics.The Microsoft Azure Quantum research team’s descriptions of a means to detect the as-yet theoretical particles[1]—called“an entirely new state of matter”by Microsoft’s chief executive officer[2]—and a design for a chip powered by them(Fig.1)[3]have refocused attention on the company’s ambition to build a topological quantum computer.The approach—if it works—could potentially leapfrog every other in the field.展开更多
A team of researchers from the University of Science and Technology of China(USTC)of the Chinese Academy of Sciences(CAS)and its partners have made significant advancements in random quantum circuit sampling with Zuch...A team of researchers from the University of Science and Technology of China(USTC)of the Chinese Academy of Sciences(CAS)and its partners have made significant advancements in random quantum circuit sampling with Zuchongzhi-3,a superconducting quantum computing prototype featuring 105 qubits and 182 couplers.展开更多
Quantum computing is a promising technology that has the potential to revolutionize many areas of science and technology,including communication.In this review,we discuss the current state of quantum computing in comm...Quantum computing is a promising technology that has the potential to revolutionize many areas of science and technology,including communication.In this review,we discuss the current state of quantum computing in communication and its potential applications in various areas such as network optimization,signal processing,and machine learning for communication.First,the basic principle of quantum computing,quantum physics systems,and quantum algorithms are analyzed.Then,based on the classification of quantum algorithms,several important basic quantum algorithms,quantum optimization algorithms,and quantum machine learning algorithms are discussed in detail.Finally,the basic ideas and feasibility of introducing quantum algorithms into communications are emphatically analyzed,which provides a reference to address computational bottlenecks in communication networks.展开更多
Privacy-Preserving Computation(PPC)comprises the techniques,schemes and protocols which ensure privacy and confidentiality in the context of secure computation and data analysis.Most of the current PPC techniques rely...Privacy-Preserving Computation(PPC)comprises the techniques,schemes and protocols which ensure privacy and confidentiality in the context of secure computation and data analysis.Most of the current PPC techniques rely on the complexity of cryptographic operations,which are expected to be efficiently solved by quantum computers soon.This review explores how PPC can be built on top of quantum computing itself to alleviate these future threats.We analyze quantum proposals for Secure Multi-party Computation,Oblivious Transfer and Homomorphic Encryption from the last decade focusing on their maturity and the challenges they currently face.Our findings show a strong focus on purely theoretical works,but a rise on the experimental consideration of these techniques in the last 5 years.The applicability of these techniques to actual use cases is an underexplored aspect which could lead to the practical assessment of these techniques.展开更多
Effective resource management in the Internet of Things and fog computing is essential for efficient and scalable networks.However,existing methods often fail in dynamic and high-demand environments,leading to resourc...Effective resource management in the Internet of Things and fog computing is essential for efficient and scalable networks.However,existing methods often fail in dynamic and high-demand environments,leading to resource bottlenecks and increased energy consumption.This study aims to address these limitations by proposing the Quantum Inspired Adaptive Resource Management(QIARM)model,which introduces novel algorithms inspired by quantum principles for enhanced resource allocation.QIARM employs a quantum superposition-inspired technique for multi-state resource representation and an adaptive learning component to adjust resources in real time dynamically.In addition,an energy-aware scheduling module minimizes power consumption by selecting optimal configurations based on energy metrics.The simulation was carried out in a 360-minute environment with eight distinct scenarios.This study introduces a novel quantum-inspired resource management framework that achieves up to 98%task offload success and reduces energy consumption by 20%,addressing critical challenges of scalability and efficiency in dynamic fog computing environments.展开更多
Distributed Quantum Computing(DQC)provides a means for scaling available quantum computation by interconnecting multiple quantum processor units(QPUs).A key challenge in this domain is efficiently allocating logical q...Distributed Quantum Computing(DQC)provides a means for scaling available quantum computation by interconnecting multiple quantum processor units(QPUs).A key challenge in this domain is efficiently allocating logical qubits from quantum circuits to the physical qubits within QPUs,a task known to be NP-hard.Traditional approaches,primarily focused on graph partitioning strategies,have sought to reduce the number of required Bell pairs for executing non-local CNOT operations,a form of gate teleportation.However,these methods have limitations in terms of efficiency and scalability.Addressing this,our work jointly considers gate and qubit teleportations introducing a novel meta-heuristic algorithm to minimise the network cost of executing a quantum circuit.By allowing dynamic reallocation of qubits along with gate teleportations during circuit execution,our method significantly enhances the overall efficacy and potential scalability of DQC frameworks.In our numerical analysis,we demonstrate that integrating qubit teleportations into our genetic algorithm for optimizing circuit blocking reduces the required resources,specifically the number of EPR pairs,compared to traditional graph partitioning methods.Our results,derived fromboth benchmark and randomly generated circuits,show that as circuit complexity increases—demanding more qubit teleportations—our approach effectively optimises these teleportations throughout the execution,thereby enhancing performance through strategic circuit partitioning.This is a step forward in the pursuit of a global quantum compiler which will ultimately enable the efficient use of a‘quantum data center’in the future.展开更多
We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of ...We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of the ions to create phonon-mediated entangling gates and,unlike the state of the art,requires neither weakcoupling Lamb-Dicke approximation nor perturbation treatment.With the application of gradient-based optimal control,it enables finding amplitude-and phase-modulated laser control protocols that work without the Lamb-Dicke approximation,promising gate speeds on the order of microseconds comparable to the characteristic trap frequencies.Also,robustness requirements on the temperature of the ions and initial optical phase can be conveniently included to pursue high-quality fast gates against experimental imperfections.Our approach represents a step in speeding up quantum gates to achieve larger quantum circuits for quantum computation and simulation,and thus can find applications in near-future experiments.展开更多
This paper investigates Windfarm Layout Optimization(WFLO),where we formulate turbine placement considering wake effects as a Quadratic Unconstrained Binary Optimization(QUBO)problem.Wind energy plays a critical role ...This paper investigates Windfarm Layout Optimization(WFLO),where we formulate turbine placement considering wake effects as a Quadratic Unconstrained Binary Optimization(QUBO)problem.Wind energy plays a critical role in the transition toward sustainable power systems,but the optimal placement of turbines remains a challenging combinatorial problem due to complex wake interactions.With recent advances in quantum computing,there is growing interest in exploring whether hybrid quantum-classical methods can provide advantages for such computationally intensive tasks.We investigate solving the resulting QUBO problem using the Variational Quantum Eigensolver(VQE)implemented onQiskit’s quantum computer simulator,employing a quantum noise-free,gate-based circuit model.Three classical optimizers are discussed,with a detailed analysis of the two most effective approaches:Constrained Optimization BY Linear Approximation(COBYLA)and Bayesian Optimization(BO).We compare these simulated quantum results with two established classical optimization methods:Simulated Annealing(SA)and the Gurobi solver.The study focuses on 4×4 grid configurations(requiring 16 qubits),providing insights into near-term quantum algorithm applicability for renewable energy optimization.展开更多
This study aims to develop a quantum computing-based neurocognitive architecture that allows an agent to perform autonomous behaviors.Therefore,we present a brain-inspired cognitive architecture for autonomous agents ...This study aims to develop a quantum computing-based neurocognitive architecture that allows an agent to perform autonomous behaviors.Therefore,we present a brain-inspired cognitive architecture for autonomous agents that integrates a prefrontal cortex-inspired model with modern deep learning(a transformer-based reinforcement learning module)and quantum algorithms.In particular,our framework incorporates quantum computational routines(Deutsch-Jozsa,Bernstein-Vazirani,and Grover’s search)to enhance decision-making efficiency.As a novelty of this research,this comprehensive computational structure is empowered by quantum computing operations so that superiority in speed and robustness of learning compared to classical methods can be demonstrated.Another main contribution is that the proposed architecture offers some features,such as meta-cognition and situation awareness.The meta-cognition aspect is responsible for hierarchically learning sub-tasks,enabling the agent to achieve the master goal.The situation-awareness property identifies how spatial-temporal reasoning activities related to the world model of the agent can be extracted in a dynamic simulation environment with unstructured uncertainties by quantum computation-based machine learning algorithms with the explainable artificial intelligence paradigm.In this research,the Minecraft game-based simulation environment is utilized for the experimental evaluation of performance and verification tests within complex,multi-objective tasks related to the autonomous behaviors of a smart agent.By implementing several interaction scenarios,the results of the system performance and comparative superiority over alternative solutions are presented,and it is discussed how these autonomous behaviors and cognitive skills of a smart agent can be improved in further studies.Results show that the quantum-enhanced agent achieves faster convergence to an 80%task 2×success rate in exploration tasks and approximately 15%higher cumulative rewards compared to a classical deep RL baseline.These findings demonstrate the potential of quantum algorithms to significantly improve learning and performance in cognitive agent architectures.However,advantages are task-specific and less pronounced under high-uncertainty,reactive scenarios.Limitations of the simulation environment are acknowledged,and a structured future research roadmap is proposed involving highfidelity simulation validation,hardware-in-the-loop robotic testing,and integration of advanced hybrid quantum-classical architectures.展开更多
Preparing quantum superposition states is a crucial step in realizing quantum algorithms,which demands substantial resources.In this paper,we propose a new method for preparing quantum uniform superposition states via...Preparing quantum superposition states is a crucial step in realizing quantum algorithms,which demands substantial resources.In this paper,we propose a new method for preparing quantum uniform superposition states via quantum measurement,and design the bitwise implementation circuit,which only contains Hadamard,CNOT,and π/8 phase gates.Compared to the Shukla–Vedula method,the number of quantum gates required by both methods scales the same,while,the new method offers stronger fault tolerance,and the ancillary qubits employed during the implementation process can be reused,making it more suitable for implementation on real quantum computers.As an application,we provide the circuit for Shor's discrete logarithm quantum algorithm,based on the new method,demonstrating its technical advantage for implementation of quantum algorithms.展开更多
In the current noisy intermediate-scale quantum(NISQ)era,a single quantum processing unit(QPU)is insufficient to implement large-scale quantum algorithms;this has driven extensive research into distributed quantum com...In the current noisy intermediate-scale quantum(NISQ)era,a single quantum processing unit(QPU)is insufficient to implement large-scale quantum algorithms;this has driven extensive research into distributed quantum computing(DQC).DQC involves the cooperative operation of multiple QPUs but is concurrently challenged by excessive communication complexity.To address this issue,this paper proposes a quantum circuit partitioning method based on spectral clustering.The approach transforms quantum circuits into weighted graphs and,through computation of the Laplacian matrix and clustering techniques,identifies candidate partition schemes that minimize the total weight of the cut.Additionally,a global gate search tree strategy is introduced to meticulously explore opportunities for merged transfer of global gates,thereby minimizing the transmission cost of distributed quantum circuits and selecting the optimal partition scheme from the candidates.Finally,the proposed method is evaluated through various comparative experiments.The experimental results demonstrate that spectral clustering-based partitioning exhibits robust stability and efficiency in runtime in quantum circuits of different scales.In experiments involving the quantum Fourier transform algorithm and Revlib quantum circuits,the transmission cost achieved by the global gate search tree strategy is significantly optimized.展开更多
Trapped ion hardware has made significant progress recently and is now one of the leading platforms for quantum computing.To construct two-qubit gates in trapped ions,experimentalmanipulation approaches for ion chains...Trapped ion hardware has made significant progress recently and is now one of the leading platforms for quantum computing.To construct two-qubit gates in trapped ions,experimentalmanipulation approaches for ion chains are becoming increasingly prevalent.Given the restricted control technology,how implementing high-fidelity quantum gate operations is crucial.Many works in current pulse design optimization focus on ion–phonon and effective ion–ion couplings while ignoring the first-order derivative terms expansion impacts of these two terms brought on by experiment defects.This paper proposes a novel robust quantum control optimization method in trapped ions.By introducing the first-order derivative terms caused by the error into the optimization cost function,we generate an extremely robust Mølmer–Sørensen gate with infidelity below 10^(−3) under a drift noise range of±10 kHz,the relative robustness achieves a tolerance of±5%,compared to the 200-kHz frequency spacing between phonon modes,and for time noise drift,the tolerance reached to 2%.Our work reveals the vital role of the first-order derivative terms of coupling in trapped ion pulse control optimization,especially the first-order derivative terms of ion–ion coupling.It provides a robust optimization scheme for realizing more efficient entangled states in trapped ion platforms.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61372076,61971348,and 62001351)Foundation of Shaanxi Key Laboratory of Information Communication Network and Security(Grant No.ICNS201802)+1 种基金Natural Science Basic Research Program of Shaanxi,China(Grant No.2021JM-142)Key Research and Development Program of Shaanxi Province,China(Grant No.2019ZDLGY09-02)。
文摘Verification in quantum computations is crucial since quantum systems are extremely vulnerable to the environment.However,verifying directly the output of a quantum computation is difficult since we know that efficiently simulating a large-scale quantum computation on a classical computer is usually thought to be impossible.To overcome this difficulty,we propose a self-testing system for quantum computations,which can be used to verify if a quantum computation is performed correctly by itself.Our basic idea is using some extra ancilla qubits to test the output of the computation.We design two kinds of permutation circuits into the original quantum circuit:one is applied on the ancilla qubits whose output indicates the testing information,the other is applied on all qubits(including ancilla qubits) which is aiming to uniformly permute the positions of all qubits.We show that both permutation circuits are easy to achieve.By this way,we prove that any quantum computation has an efficient self-testing system.In the end,we also discuss the relation between our self-testing system and interactive proof systems,and show that the two systems are equivalent if the verifier is allowed to have some quantum capacity.
基金Project supported by the National Natural Science Foundation of China(Grant No.61573266)the Natural Science Basic Research Program of Shaanxi(Grant No.2021JM-133)the Fundamental Research Funds for the Central Universities and the Innovation Fund of Xidian University(Grant No.YJSJ25009)。
文摘Efficient implementation of fundamental matrix operations on quantum computers,such as matrix products and Hadamard operations,holds significant potential for accelerating machine learning algorithms.A critical prerequisite for quantum implementations is the effective encoding of classical data into quantum states.We propose two quantum computing frameworks for preparing the distinct encoded states corresponding to matrix operations,including the matrix product,matrix sum,matrix Hadamard product and division.Quantum algorithms based on the digital encoding computing framework are capable of implementing the matrix Hadamard operation with a time complexity of O(poly log(mn/ε))and the matrix product with a time complexity of O(poly log(mnl/ε)),achieving an exponential speedup in contrast to the classical methods of O(mn)and O(mnl).Quantum algorithms based on the analog-encoding framework are capable of implementing the matrix Hadamard operation with a time complexity of O(k_(1)√mn·poly log(mn/ε))and the matrix product with a time complexity of O(k_(2)√1·poly log(mnl/ε)),where k_(1)and k_(2)are coefficients correlated with the elements of the matrix,achieving a square speedup in contrast to the classical counterparts.As applications,we construct an oracle that can access the trace of a matrix within logarithmic time,and propose several algorithms to respectively estimate the trace of a matrix,the trace of the product of two matrices,and the trace inner product of two matrices within logarithmic time.
文摘The increasing popularity of quantum computing has resulted in a considerable rise in demand for cloud quantum computing usage in recent years.Nevertheless,the rapid surge in demand for cloud-based quantum computing resources has led to a scarcity.In order to meet the needs of an increasing number of researchers,it is imperative to facilitate efficient and flexible access to computing resources in a cloud environment.In this paper,we propose a novel quantum computing paradigm,Virtual QPU(VQPU),which addresses this issue and enhances quantum cloud throughput with guaranteed circuit fidelity.The proposal introduces three innovative concepts:(1)The integration of virtualization technology into the field of quantum computing to enhance quantum cloud throughput.(2)The introduction of an asynchronous execution of circuits methodology to improve quantum computing flexibility.(3)The development of a virtual QPU allocation scheme for quantum tasks in a cloud environment to improve circuit fidelity.The concepts have been validated through the utilization of a self-built simulated quantum cloud platform.
文摘As an important index to measure the degree of entanglement in quantum systems,concurrence plays an important role in practical research.In this paper,we study the concurrence between two qubits in triangular triple quantum dot structure.Through calculation and simulation,it is found that concurrence is mainly affected by the interdot coupling strength t,Coulomb interactionU,temperature T,and electrode coupling G.Through comparative studies with parallel triple quantum dot structures,we demonstrate that the triangular geometry exhibits significantly enhanced concurrence under identical conditions.In addition,under the condition that concurrence exceeds 0.9,the functional relationship between t and U is obtained through simulation,which provides theoretical support for quantum dot regulation under high entanglement.Finally,we demonstrate the feasibility of implementing a three-qubit quantum gate,using the Toffoli gate as a representative example,under the condition that the triangular triple quantum dot system maintains high entanglement.
基金supported by the Major Project for the Integration of ScienceEducation and Industry (Grant No.2025ZDZX02)。
文摘Classical computation of electronic properties in large-scale materials remains challenging.Quantum computation has the potential to offer advantages in memory footprint and computational scaling.However,general and viable quantum algorithms for simulating large-scale materials are still limited.We propose and implement random-state quantum algorithms to calculate electronic-structure properties of real materials.Using a random state circuit on a small number of qubits,we employ real-time evolution with first-order Trotter decomposition and Hadamard test to obtain electronic density of states,and we develop a modified quantum phase estimation algorithm to calculate real-space local density of states via direct quantum measurements.Furthermore,we validate these algorithms by numerically computing the density of states and spatial distributions of electronic states in graphene,twisted bilayer graphene quasicrystals,and fractal lattices,covering system sizes from hundreds to thousands of atoms.Our results manifest that the random-state quantum algorithms provide a general and qubit-efficient route to scalable simulations of electronic properties in large-scale periodic and aperiodic materials.
文摘The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreserving computation.Classical MPC relies on cryptographic techniques such as homomorphic encryption,secret sharing,and oblivious transfer,which may become vulnerable in the post-quantum era due to the computational power of quantum adversaries.This study presents a review of 140 peer-reviewed articles published between 2000 and 2025 that used different databases like MDPI,IEEE Explore,Springer,and Elsevier,examining the applications,types,and security issues with the solution of Quantum computing in different fields.This review explores the impact of quantum computing on MPC security,assesses emerging quantum-resistant MPC protocols,and examines hybrid classicalquantum approaches aimed at mitigating quantum threats.We analyze the role of Quantum Key Distribution(QKD),post-quantum cryptography(PQC),and quantum homomorphic encryption in securing multiparty computations.Additionally,we discuss the challenges of scalability,computational efficiency,and practical deployment of quantumsecure MPC frameworks in real-world applications such as privacy-preserving AI,secure blockchain transactions,and confidential data analysis.This review provides insights into the future research directions and open challenges in ensuring secure,scalable,and quantum-resistant multiparty computation.
基金supported by the National Natural Science Foundation of China(Grants No.12274422)the Natural Science Foundation of Hubei Province(Grant No.2022CFA013)support from A*STAR(Grant Nos.C230917003 and C230917007)。
文摘Reservoir engineering has been widely used in various quantum technologies.Based on a cavity-QED(quantum electrodynamics)model,we propose a potentially practical scheme using squeezed-vacuum reservoir engineering to optimize the performance of a quantum battery(QB)located inside a cavity driven by a broadband squeezed laser,which acts as a squeezed-vacuum reservoir.Using the reduced master equation of the QB obtained via the adiabatic elimination method,we focus on the QB's charging dynamics under tunable squeezed reservoirs governed by parametrically controlled squeezing parameters,which dictate the efficiency of energy transfer and the extractable work(ergotropy)of the QB.We show that increasing the squeezing strength improves the charging rate and enables rapid energy transfer,whereas the steady-state energy of the QB saturates at specific values of the squeezing parameter.Notably,the ergotropy of the QB reaches its maximum at a critical squeezing strength and does not scale monotonically with the squeezing strength.This nonmonotonic behavior underscores the existence of optimal parameter regimes,through which the performance of the QB can be significantly enhanced.
文摘In the 9 December 2024 issue of Nature[1],a team of Google engineers reported breakthrough results using“Willow”,their lat-est quantum computing chip(Fig.1).By meeting a milestone“below threshold”reduction in the rate of errors that plague super-conducting circuit-based quantum computing systems(Fig.2),the work moves the field another step towards its promised super-charged applications,albeit likely still many years away.Areas expected to benefit from quantum computing include,among others,drug discovery,materials science,finance,cybersecurity,and machine learning.
文摘With a paper published in the 19 February 2025 issue of Nature[1],Microsoft(Redmond,WA,USA)fanned the flames of its unique vision for quantum computing:a stable,error-resistant qubit based on the Majorana fermion,one of the strangest and most elusive particles in physics.The Microsoft Azure Quantum research team’s descriptions of a means to detect the as-yet theoretical particles[1]—called“an entirely new state of matter”by Microsoft’s chief executive officer[2]—and a design for a chip powered by them(Fig.1)[3]have refocused attention on the company’s ambition to build a topological quantum computer.The approach—if it works—could potentially leapfrog every other in the field.
文摘A team of researchers from the University of Science and Technology of China(USTC)of the Chinese Academy of Sciences(CAS)and its partners have made significant advancements in random quantum circuit sampling with Zuchongzhi-3,a superconducting quantum computing prototype featuring 105 qubits and 182 couplers.
文摘Quantum computing is a promising technology that has the potential to revolutionize many areas of science and technology,including communication.In this review,we discuss the current state of quantum computing in communication and its potential applications in various areas such as network optimization,signal processing,and machine learning for communication.First,the basic principle of quantum computing,quantum physics systems,and quantum algorithms are analyzed.Then,based on the classification of quantum algorithms,several important basic quantum algorithms,quantum optimization algorithms,and quantum machine learning algorithms are discussed in detail.Finally,the basic ideas and feasibility of introducing quantum algorithms into communications are emphatically analyzed,which provides a reference to address computational bottlenecks in communication networks.
基金supported by the Basque Government through the ELKARTEK program for Research and Innovation,under the BRTAQUANTUM project(Grant Agreement No.KK-2022/00041)。
文摘Privacy-Preserving Computation(PPC)comprises the techniques,schemes and protocols which ensure privacy and confidentiality in the context of secure computation and data analysis.Most of the current PPC techniques rely on the complexity of cryptographic operations,which are expected to be efficiently solved by quantum computers soon.This review explores how PPC can be built on top of quantum computing itself to alleviate these future threats.We analyze quantum proposals for Secure Multi-party Computation,Oblivious Transfer and Homomorphic Encryption from the last decade focusing on their maturity and the challenges they currently face.Our findings show a strong focus on purely theoretical works,but a rise on the experimental consideration of these techniques in the last 5 years.The applicability of these techniques to actual use cases is an underexplored aspect which could lead to the practical assessment of these techniques.
基金funded by Researchers Supporting Project Number(RSPD2025R947)King Saud University,Riyadh,Saudi Arabia.
文摘Effective resource management in the Internet of Things and fog computing is essential for efficient and scalable networks.However,existing methods often fail in dynamic and high-demand environments,leading to resource bottlenecks and increased energy consumption.This study aims to address these limitations by proposing the Quantum Inspired Adaptive Resource Management(QIARM)model,which introduces novel algorithms inspired by quantum principles for enhanced resource allocation.QIARM employs a quantum superposition-inspired technique for multi-state resource representation and an adaptive learning component to adjust resources in real time dynamically.In addition,an energy-aware scheduling module minimizes power consumption by selecting optimal configurations based on energy metrics.The simulation was carried out in a 360-minute environment with eight distinct scenarios.This study introduces a novel quantum-inspired resource management framework that achieves up to 98%task offload success and reduces energy consumption by 20%,addressing critical challenges of scalability and efficiency in dynamic fog computing environments.
文摘Distributed Quantum Computing(DQC)provides a means for scaling available quantum computation by interconnecting multiple quantum processor units(QPUs).A key challenge in this domain is efficiently allocating logical qubits from quantum circuits to the physical qubits within QPUs,a task known to be NP-hard.Traditional approaches,primarily focused on graph partitioning strategies,have sought to reduce the number of required Bell pairs for executing non-local CNOT operations,a form of gate teleportation.However,these methods have limitations in terms of efficiency and scalability.Addressing this,our work jointly considers gate and qubit teleportations introducing a novel meta-heuristic algorithm to minimise the network cost of executing a quantum circuit.By allowing dynamic reallocation of qubits along with gate teleportations during circuit execution,our method significantly enhances the overall efficacy and potential scalability of DQC frameworks.In our numerical analysis,we demonstrate that integrating qubit teleportations into our genetic algorithm for optimizing circuit blocking reduces the required resources,specifically the number of EPR pairs,compared to traditional graph partitioning methods.Our results,derived fromboth benchmark and randomly generated circuits,show that as circuit complexity increases—demanding more qubit teleportations—our approach effectively optimises these teleportations throughout the execution,thereby enhancing performance through strategic circuit partitioning.This is a step forward in the pursuit of a global quantum compiler which will ultimately enable the efficient use of a‘quantum data center’in the future.
基金supported by the National Natural Science Foundation of China(Grant Nos.12441502,12122506,12204230,and 12404554)the National Science and Technology Major Project of the Ministry of Science and Technology of China(2024ZD0300404)+6 种基金Guangdong Basic and Applied Basic Research Foundation(Grant No.2021B1515020070)Shenzhen Science and Technology Program(Grant No.RCYX20200714114522109)China Postdoctoral Science Foundation(CPSF)(2024M762114)Postdoctoral Fellowship Program of CPSF(GZC20231727)supported by the National Natural Science Foundation of China(Grant Nos.92165206 and 11974330)Innovation Program for Quantum Science and Technology(Grant No.2021ZD0301603)the Fundamental Research Funds for the Central Universities。
文摘We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of the ions to create phonon-mediated entangling gates and,unlike the state of the art,requires neither weakcoupling Lamb-Dicke approximation nor perturbation treatment.With the application of gradient-based optimal control,it enables finding amplitude-and phase-modulated laser control protocols that work without the Lamb-Dicke approximation,promising gate speeds on the order of microseconds comparable to the characteristic trap frequencies.Also,robustness requirements on the temperature of the ions and initial optical phase can be conveniently included to pursue high-quality fast gates against experimental imperfections.Our approach represents a step in speeding up quantum gates to achieve larger quantum circuits for quantum computation and simulation,and thus can find applications in near-future experiments.
文摘This paper investigates Windfarm Layout Optimization(WFLO),where we formulate turbine placement considering wake effects as a Quadratic Unconstrained Binary Optimization(QUBO)problem.Wind energy plays a critical role in the transition toward sustainable power systems,but the optimal placement of turbines remains a challenging combinatorial problem due to complex wake interactions.With recent advances in quantum computing,there is growing interest in exploring whether hybrid quantum-classical methods can provide advantages for such computationally intensive tasks.We investigate solving the resulting QUBO problem using the Variational Quantum Eigensolver(VQE)implemented onQiskit’s quantum computer simulator,employing a quantum noise-free,gate-based circuit model.Three classical optimizers are discussed,with a detailed analysis of the two most effective approaches:Constrained Optimization BY Linear Approximation(COBYLA)and Bayesian Optimization(BO).We compare these simulated quantum results with two established classical optimization methods:Simulated Annealing(SA)and the Gurobi solver.The study focuses on 4×4 grid configurations(requiring 16 qubits),providing insights into near-term quantum algorithm applicability for renewable energy optimization.
文摘This study aims to develop a quantum computing-based neurocognitive architecture that allows an agent to perform autonomous behaviors.Therefore,we present a brain-inspired cognitive architecture for autonomous agents that integrates a prefrontal cortex-inspired model with modern deep learning(a transformer-based reinforcement learning module)and quantum algorithms.In particular,our framework incorporates quantum computational routines(Deutsch-Jozsa,Bernstein-Vazirani,and Grover’s search)to enhance decision-making efficiency.As a novelty of this research,this comprehensive computational structure is empowered by quantum computing operations so that superiority in speed and robustness of learning compared to classical methods can be demonstrated.Another main contribution is that the proposed architecture offers some features,such as meta-cognition and situation awareness.The meta-cognition aspect is responsible for hierarchically learning sub-tasks,enabling the agent to achieve the master goal.The situation-awareness property identifies how spatial-temporal reasoning activities related to the world model of the agent can be extracted in a dynamic simulation environment with unstructured uncertainties by quantum computation-based machine learning algorithms with the explainable artificial intelligence paradigm.In this research,the Minecraft game-based simulation environment is utilized for the experimental evaluation of performance and verification tests within complex,multi-objective tasks related to the autonomous behaviors of a smart agent.By implementing several interaction scenarios,the results of the system performance and comparative superiority over alternative solutions are presented,and it is discussed how these autonomous behaviors and cognitive skills of a smart agent can be improved in further studies.Results show that the quantum-enhanced agent achieves faster convergence to an 80%task 2×success rate in exploration tasks and approximately 15%higher cumulative rewards compared to a classical deep RL baseline.These findings demonstrate the potential of quantum algorithms to significantly improve learning and performance in cognitive agent architectures.However,advantages are task-specific and less pronounced under high-uncertainty,reactive scenarios.Limitations of the simulation environment are acknowledged,and a structured future research roadmap is proposed involving highfidelity simulation validation,hardware-in-the-loop robotic testing,and integration of advanced hybrid quantum-classical architectures.
基金supported by National Key Research and Development Program of China(Grant No.2020YFA0309702)the National Natural Science Foundation of China(Grant No.61502526)+1 种基金NSAF(Grant No.U2130205)the Natural Science Foundation of Henan Province,China(Grant Nos.202300410532 and 252300421818)。
文摘Preparing quantum superposition states is a crucial step in realizing quantum algorithms,which demands substantial resources.In this paper,we propose a new method for preparing quantum uniform superposition states via quantum measurement,and design the bitwise implementation circuit,which only contains Hadamard,CNOT,and π/8 phase gates.Compared to the Shukla–Vedula method,the number of quantum gates required by both methods scales the same,while,the new method offers stronger fault tolerance,and the ancillary qubits employed during the implementation process can be reused,making it more suitable for implementation on real quantum computers.As an application,we provide the circuit for Shor's discrete logarithm quantum algorithm,based on the new method,demonstrating its technical advantage for implementation of quantum algorithms.
基金supported by the National Natural Science Foundation of China(Grant No.62072259)in part by the Natural Science Foundation of Jiangsu Province(Grant No.BK20221411)+1 种基金the PhD Start-up Fund of Nantong University(Grant No.23B03)the Postgraduate Research&Practice Innovation Program of School of Information Science and Technology,Nantong University(Grant No.NTUSISTPR2405).
文摘In the current noisy intermediate-scale quantum(NISQ)era,a single quantum processing unit(QPU)is insufficient to implement large-scale quantum algorithms;this has driven extensive research into distributed quantum computing(DQC).DQC involves the cooperative operation of multiple QPUs but is concurrently challenged by excessive communication complexity.To address this issue,this paper proposes a quantum circuit partitioning method based on spectral clustering.The approach transforms quantum circuits into weighted graphs and,through computation of the Laplacian matrix and clustering techniques,identifies candidate partition schemes that minimize the total weight of the cut.Additionally,a global gate search tree strategy is introduced to meticulously explore opportunities for merged transfer of global gates,thereby minimizing the transmission cost of distributed quantum circuits and selecting the optimal partition scheme from the candidates.Finally,the proposed method is evaluated through various comparative experiments.The experimental results demonstrate that spectral clustering-based partitioning exhibits robust stability and efficiency in runtime in quantum circuits of different scales.In experiments involving the quantum Fourier transform algorithm and Revlib quantum circuits,the transmission cost achieved by the global gate search tree strategy is significantly optimized.
文摘Trapped ion hardware has made significant progress recently and is now one of the leading platforms for quantum computing.To construct two-qubit gates in trapped ions,experimentalmanipulation approaches for ion chains are becoming increasingly prevalent.Given the restricted control technology,how implementing high-fidelity quantum gate operations is crucial.Many works in current pulse design optimization focus on ion–phonon and effective ion–ion couplings while ignoring the first-order derivative terms expansion impacts of these two terms brought on by experiment defects.This paper proposes a novel robust quantum control optimization method in trapped ions.By introducing the first-order derivative terms caused by the error into the optimization cost function,we generate an extremely robust Mølmer–Sørensen gate with infidelity below 10^(−3) under a drift noise range of±10 kHz,the relative robustness achieves a tolerance of±5%,compared to the 200-kHz frequency spacing between phonon modes,and for time noise drift,the tolerance reached to 2%.Our work reveals the vital role of the first-order derivative terms of coupling in trapped ion pulse control optimization,especially the first-order derivative terms of ion–ion coupling.It provides a robust optimization scheme for realizing more efficient entangled states in trapped ion platforms.
