Obfuscating Quantum Hybrid-Classical Algorithms for Security and Privacy

• URL: http://arxiv.org/abs/2305.02379v1
• Date: Wed, 3 May 2023 18:35:14 GMT
• Title: Obfuscating Quantum Hybrid-Classical Algorithms for Security and Privacy
• Authors: Suryansh Upadhyay, Swaroop Ghosh
• Abstract summary: Quantum classical algorithms like QAOA encode the graph properties to solve a graph maxcut problem. Usage of untrusted hardware could present the risk of intellectual property (IP) theft. We propose an edge pruning obfuscation method for QAOA along with a split iteration methodology.
• Score: 5.444459446244819
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: As the quantum computing ecosystem grows in popularity and utility it is important to identify and address the security and privacy vulnerabilities before they can be widely exploited. One major concern is the involvement of third party tools and hardware. Usage of untrusted hardware could present the risk of intellectual property (IP) theft. For example the hybrid quantum classical algorithms like QAOA encodes the graph properties e.g. number of nodes edges and connectivity in the parameterized quantum circuit to solve a graph maxcut problem. QAOA employs a classical computer which optimizes the parameters of a parametric quantum circuit (which encodes graph structure) iteratively by executing the circuit on a quantum hardware and measuring the output. The graph properties can be readily retrieved by analyzing the QAOA circuit by the untrusted quantum hardware provider. To mitigate this risk, we propose an edge pruning obfuscation method for QAOA along with a split iteration methodology. The basic idea is to (i) create two flavors of QAOA circuit each with few distinct edges eliminated from the problem graph for obfuscation (ii) iterate the circuits alternately during optimization process to uphold the optimization quality and (iii) send the circuits to two different untrusted hardware provider so that the adversary has access to partial graph protecting the IP. We demonstrate that combining edge pruning obfuscation with split iteration on two different hardware secures the IP and increases the difficulty of reconstruction while limiting performance degradation to a maximum of 10 percent (approximately 5 percent on average) and maintaining low overhead costs (less than 0.5X for QAOA with single layer implementation).

Related papers

• E-LoQ: Enhanced Locking for Quantum Circuit IP Protection [7.692750040732365]
  We propose an enhanced locking technique for quantum circuits (E-LoQ) Compared to previous work that used one qubit for each key bit, our approach achieves higher security levels. Our results demonstrate that E-LoQ effectively conceals the function of the original quantum circuit, with an average fidelity degradation of less than 1%.
  arXiv  Detail & Related papers  (2024-12-22T17:29:24Z)
• Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization [0.8121127831316319]
  We propose a method for constructing quantum circuits which greatly reduces inter-device communication costs. We show that we can construct tractable circuits nearly three times the size of previous QDCA methods while retaining a similar or greater level of quality.
  arXiv  Detail & Related papers  (2024-05-01T20:49:50Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Enigma: Privacy-Preserving Execution of QAOA on Untrusted Quantum Computers [0.6144680854063939]
  We propose Enigma, a suite of privacy-preserving quantum computation schemes. Unlike previous SQC schemes that obfuscate quantum circuits, Enigma transforms the input problem of QAOA. We show that the privacy improvements of Enigma come at only a small reduction in fidelity.
  arXiv  Detail & Related papers  (2023-11-22T17:40:23Z)
• Randomized Reversible Gate-Based Obfuscation for Secured Compilation of Quantum Circuit [5.444459446244819]
  We propose an obfuscation technique for quantum circuits using reversible gates to protect them from such attacks during compilation. Our method achieves TVD of up to 1.92 and performs at least 2X better than a previously reported obfuscation method.
  arXiv  Detail & Related papers  (2023-05-02T00:24:34Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• A Structured Method for Compilation of QAOA Circuits in Quantum Computing [5.560410979877026]
  The flexibility in reordering the two-qubit gates allows compiler optimizations to generate circuits with better depths, gate count, and fidelity. We propose a structured method that ensures linear depth for any compiled QAOA circuit on multi-dimensional quantum architectures. Overall, we can compile a circuit with up to 1024 qubits in 10 seconds with a 3.8X speedup in depth, 17% reduction in gate count, and 18X improvement for circuit ESP.
  arXiv  Detail & Related papers  (2021-12-12T04:00:45Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.