Back to News
quantum-computing

qiskit code for detecting counterfeit quantum coins

/u/MichaelTiemann
Loading...
1 min read
0 likes
⚡ Quantum Brief
A Reddit user shared a Qiskit implementation of a quantum algorithm for detecting counterfeit coins, inspired by a 2010 arXiv paper claiming a quartic speedup over classical methods. The 12-qubit circuit uses Hadamard and controlled-X gates, with conditional operations based on measurement outcomes to identify a counterfeit coin (hardcoded as qubit 6). The implementation includes mid-circuit measurements and classical feedback loops, leveraging Qiskit’s EstimatorV2 for runtime execution on IBM’s quantum hardware. The author expresses skepticism about the code’s optimality, questioning whether it fully captures the theoretical advantages described in the referenced paper. The post invites collaboration from the quantum computing community to refine or propose alternative circuit designs for this problem.
AI Audio Summary
0:00 / 0:00
Click to play
Quantum computing technology
Unsplash · Validated Fallback

I came across this paper describing a quantum algorithm that's a quartic improvement over classical implementations: https://ui.adsabs.harvard.edu/abs/2010arXiv1009.0416I/abstract I also found some code from the QAsm world that claimed to implement a quantum counterfeit coin detector. I translated it into QisKit code: from qiskit import QuantumCircuit, QuantumRegister, ClassicalRegister from qiskit_ibm_runtime import EstimatorV2 as Estimator nbits = 12 # Create a new circuit with 12 qubits and one classical bit qubits = QuantumRegister(nbits) clbits = ClassicalRegister(nbits) qc = QuantumCircuit(qubits,clbits) # Add a Hadamard gate to qubits 0-10 for i in range(nbits-1): qc.h(i) # Perform a controlled-X gate on qubits 0-10, controlled by qubit 11 for i in range(nbits-1): qc.cx(i, nbits-1) qc.measure(nbits-1, nbits-1) with qc.if_test((clbits, 0)): qc.x(nbits-1) with qc.if_test((clbits, 0)): qc.h(nbits-1) for i in range(nbits-1): with qc.if_test((clbits, 1<<(nbits-1))): qc.h(i) qc.barrier(qubits) # qubits[6] is the counterfeit coin with qc.if_test((clbits, 0)): qc.cx(6,nbits-1); qc.barrier(qubits) for i in range(nbits-1): with qc.if_test((clbits, 0)): qc.h(i) for i in range(nbits-1): qc.measure(i, i) But I'm not satisfied that this either implements the optimal algorithm. Has anybody worked on this problem and wants to share any insights as to how to implement the appropriate quantum circuits? submitted by /u/MichaelTiemann [link] [comments]

Read Original

Tags

quantum-algorithms
quantum-hardware
quantum-programming

Source Information

Source: Reddit r/QuantumComputing (RSS)

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.