Related papers: Exact requirements for battery-assisted qubit gate…
We develop a unitary dependence theory to characterize the behaviors of quantum circuits and states in terms of how quantum gates manipulate qubits and determine their measurement probabilities. A qubit has dependence on a 1-qubit unitary…
We introduce a novel algorithm for the task of coherently controlling a quantum mechanical system to implement any chosen unitary dynamics. It performs faster than existing state of the art methods by one to three orders of magnitude…
The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets…
One of the largest obstacles to building a quantum computer is gate error, where the physical evolution of the state of a qubit or group of qubits during a gate operation does not match the intended unitary transformation. Gate error stems…
Quantum batteries are energy storage devices built using quantum mechanical objects, which are developed with the aim of outperforming their classical counterparts. Proposing optimal designs of quantum batteries which are able to exploit…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
Precision, robustness, and efficiency are crucial aspects in the design of quantum technologies. Here, we show how genuine quantum features, together with non-Gaussianity, can be the key elements to achieve the best of these three aspects…
Finding a quantum battery model that demonstrates a quantum advantage while remaining feasible for experimental production is a considerable challenge. Here, a superconducting quantum battery (SQB) model that exhibits such an advantage is…
Successful implementation of a fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used to control the many-qubit state. It is known that an accuracy threshold $P_{a}$ exists for any quantum gate…
Unitarity randomized benchmarking (URB) is an experimental procedure for estimating the coherence of implemented quantum gates independently of state preparation and measurement errors. These estimates of the coherence are measured by the…
The implementation of fault-tolerant quantum gates on encoded logic qubits is considered. It is shown that transversal implementation of logic gates based on simple geometric control ideas is problematic for realistic physical systems…
We analyze in detail the so-called "pushing gate" for trapped ions, introducing a time dependent harmonic approximation for the external motion. We show how to extract the average fidelity for the gate from the resulting semi-classical…
In recent investigations, it has been found that conservation laws generally lead to precision limits on quantum computing. Lower bounds of the error probability have been obtained for various logic operations from the commutation relation…
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single…
A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…
Quantum batteries are miniature energy storage devices and play a very important role in quantum thermodynamics. In recent years, quantum batteries have been extensively studied, but limited in theoretical level. Here we report the…
We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula…
Future quantum devices often rely on favourable scaling with respect to the system components. To achieve desirable scaling, it is therefore crucial to implement unitary transformations in an efficient manner. We develop an upper bound for…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
To guarantee the normal functioning of quantum devices in different scenarios, appropriate benchmarking tool kits are quite significant. Inspired by the recent progress on quantum state verification, here we establish a general framework of…