While recent breakthroughs in quantum computing promise the nascence of the quantum information age, quantum states remain delicate to control. Moreover, the required energy budget for large scale quantum applications has only sparely been considered. Addressing either of these issues necessitates a careful study of the most energetically efficient implementation of elementary quantum operations. In the present analysis, we show that this optimal control problem can be solved within the powerful framework of quantum speed limits. To this end, we derive state-independent lower bounds on the energetic cost, from which we find the universally optimal implementation of unitary quantum gates, for both single and $N$-qubit operations.Comment: 19 ...
We study the maximum speed of quantum computation and how it is affected by limitations on physical ...
Quantum control is an important prerequisite for quantum devices [1]. A major obstacle is the fact t...
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to ...
The traditional quantum speed limits are not attainable for many physical processes, as they tend to...
We examine the effectiveness and resilience of achieving quantum gates employing three approaches st...
The compiling of quantum gates is crucial for the successful quantum algorithm implementations. The ...
We derive generalized quantum speed limit inequalities that represent limitations on the time evolut...
Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qub...
| openaire: EC/H2020/681311/EU//QUESSIn the near future, one of the major challenges in the realizat...
Landauer’s principle asserts that any computation has an unavoidable energy cost that grows proporti...
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary op...
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary op...
The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers...
In the near future, one of the major challenges in the realization of large-scale quantum computers ...
In the near future, one of the major challenges in the realization of large-scale quantum computers ...
We study the maximum speed of quantum computation and how it is affected by limitations on physical ...
Quantum control is an important prerequisite for quantum devices [1]. A major obstacle is the fact t...
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to ...
The traditional quantum speed limits are not attainable for many physical processes, as they tend to...
We examine the effectiveness and resilience of achieving quantum gates employing three approaches st...
The compiling of quantum gates is crucial for the successful quantum algorithm implementations. The ...
We derive generalized quantum speed limit inequalities that represent limitations on the time evolut...
Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qub...
| openaire: EC/H2020/681311/EU//QUESSIn the near future, one of the major challenges in the realizat...
Landauer’s principle asserts that any computation has an unavoidable energy cost that grows proporti...
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary op...
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary op...
The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers...
In the near future, one of the major challenges in the realization of large-scale quantum computers ...
In the near future, one of the major challenges in the realization of large-scale quantum computers ...
We study the maximum speed of quantum computation and how it is affected by limitations on physical ...
Quantum control is an important prerequisite for quantum devices [1]. A major obstacle is the fact t...
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to ...