Improved Quantum Supersampling for Quantum Ray Tracing

• URL: http://arxiv.org/abs/2208.05171v1
• Date: Wed, 10 Aug 2022 06:23:22 GMT
• Title: Improved Quantum Supersampling for Quantum Ray Tracing
• Abstract summary: In this paper, we improve quantum supersampling by replacing the QFT-based phase estimation in quantum supersampling with a robust quantum counting scheme. We quantitatively study and compare the performances of different quantum counting schemes.
• Score: 5.324438395515079
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Ray tracing algorithm is a category of rendering algorithms that calculate the color of pixels by simulating the physical movements of a huge amount of rays and calculating their energies, which can be implemented in parallel. Meanwhile, the superposition and entanglement property make quantum computing a natural fit for parallel tasks.Here comes an interesting question, is the inherently parallel quantum computing able to speed up the inherently parallel ray tracing algorithm? The ray tracing problem can be regarded as a high-dimensional numerical integration problem. Suppose $N$ queries are used, classical Monte Carlo approaches has an error convergence of $O(1/\sqrt{N})$, while the quantum supersampling algorithm can achieve an error convergence of approximately $O(1/N)$. However, the outputs of the origin form of quantum supersampling obeys a probability distribution that has a long tail, which shows up as many detached abnormal noisy dots on images. In this paper, we improve quantum supersampling by replacing the QFT-based phase estimation in quantum supersampling with a robust quantum counting scheme, the QFT-based adaptive Bayesian phase estimation. We quantitatively study and compare the performances of different quantum counting schemes. Finally, we do simulation experiments to show that the quantum ray tracing with improved quantum supersampling does perform better than classical path tracing algorithm as well as the original form of quantum supersampling.

Related papers

• Basis Adaptive Algorithm for Quantum Many-Body Systems on Quantum Computers [2.4713653282916126]
  A new basis adaptive algorithm is introduced to efficiently find the ground-state properties of quantum many-body systems.<n>We benchmark this approach on the spin-1/2 XXZ chain up to 24 qubits using the IBM Heron processor.
  arXiv  Detail & Related papers  (2025-12-14T16:34:19Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• 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)
• Sample-size-reduction of quantum states for the noisy linear problem [0.0]
  We show that it is possible to reduce a quantum sample size in a quantum random access memory (QRAM) to the linearithmic order. We achieve a shorter run-time for the noisy linear problem.
  arXiv  Detail & Related papers  (2023-01-08T05:53:17Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Quantum Speedup for Higher-Order Unconstrained Binary Optimization and MIMO Maximum Likelihood Detection [2.5272389610447856]
  We propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization problem. The proposed algorithm is capable of reducing the query complexity in the classical domain and providing a quadratic speedup in the quantum domain.
  arXiv  Detail & Related papers  (2022-05-31T00:14:49Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
  We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit. The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$. We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
  arXiv  Detail & Related papers  (2021-12-29T12:33:41Z)
• Accelerating Variational Quantum Algorithms Using Circuit Concurrency [2.4718252151897886]
  Variational quantum algorithms (VQAs) provide a promising approach to achieve quantum advantage in the noisy intermediate-scale quantum era. We show that circuit-level iteration provides a means to increase the performance of VQAs on noisy quantum computers.
  arXiv  Detail & Related papers  (2021-09-03T19:31:36Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Fast-Forwarding with NISQ Processors without Feedback Loop [0.0]
  We present the Classical Quantum Fast Forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation. CQFF removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries. Our work provides a $104$ improvement over the previous record.
  arXiv  Detail & Related papers  (2021-04-05T14:29:33Z)

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.