Search Results for author:
Found 5 papers, 1 papers with code
Élivágar: Efficient Quantum Circuit Search for Classification
Although recent Quantum Circuit Search (QCS) methods attempt to search for performant QML circuits that are also robust to hardware noise, they directly adopt designs from classical Neural Architecture Search (NAS) that are misaligned with the unique constraints of quantum hardware, resulting in high search overheads and severe performance bottlenecks.
Skipper: Improving the Reach and Fidelity of Quantum Annealers by Skipping Long Chains
We propose Skipper, a software technique that enhances the capacity and fidelity of QAs by skipping dominant chains and substituting their program qubit with two readout results.
Enigma: Privacy-Preserving Execution of QAOA on Untrusted Quantum Computers
As quantum computers are expensive and hard to maintain, the typical model for performing quantum computation is to send the circuit to a quantum cloud provider.
FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodes
In QAOA, the problem graph is translated into a quantum circuit such that every edge corresponds to two 2-qubit CNOT operations in each layer of the circuit.
MAZE: Data-Free Model Stealing Attack Using Zeroth-Order Gradient Estimation
The effectiveness of such attacks relies heavily on the availability of data necessary to query the target model.
