BEGIN:VCALENDAR
PRODID:-//AddEvent Inc//AddEvent.com v1.7//EN
VERSION:2.0
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20261101T010000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DESCRIPTION:We introduce an improved CNOT synthesis algorithm that accounts for nearest-neighbour interactions and CNOT gate error rates in noisy intermediate-scale quantum (NISQ) hardware. Our contribution is twofold. First\, we define a cost function\, \Cost\, by approximating the average gate fidelity Favg. According to the simulation results\, \Cost fits the error probability of a noisy CNOT circuit\, Prob = 1 - Favg\, much tighter than the commonly used cost functions. On IBM's fake Nairobi backend\, it fits Prob with an error at most 10^(-3). On other backends\, it fits Prob with an error at most 10^(-1). Moreover\, it circumvents the computation complexity of calculating Favg and shows remarkable scalability.\n\nSecond\, we propose an architecture-aware CNOT synthesis algorithm\, NAPermRowCol\, by adapting the leading Steiner-tree-based synthesis algorithms. A weighted edge is used to encode a CNOT gate error rate and \Cost-instructed heuristics are applied to each reduction step. NAPermRowCol is benchmarked against the state-of-the-art CNOT synthesis algorithms in terms of the \Cost metric and the synthesized CNOT count. On average\, for all input CNOT circuits with no more than 16 qubits\, it is 2 times cheaper than Qiskit and it reduces the synthesized gate count by 20 times. Compared with algorithms that are noise-agnostic\, it is effective and scalable to improve the fidelity of CNOT circuits. Depending on the benchmark circuit and the IBM backend selected\, it lowers the synthesized CNOT count up to 58.71% compared to ROWCOL and up to 17.25% compared to PermRowCol. Moreover\, it reduces the \Cost of a synthesized CNOT circuit\, up to 56.92% compared to ROWCOL and up to 21.6% compared to PermRowCol.\n\nUsing the \Cost metric\, NAPermRowCol improves the fidelity and execution time of a synthesized CNOT circuit across varied NISQ hardware. It does not use ancillary qubits and it is not restricted to certain initial qubit maps. It could be generalized to route a more complicated quantum circuit\, and thus boost the overall efficiency and accuracy of quantum computing on NISQ devices. \n\nJoint-work with: Dohun Kim\, Minyoung Kim\, and Michele Mosca
X-ALT-DESC;FMTTYPE=text/html:We introduce an improved CNOT synthesis algorithm that accounts for nearest-neighbour interactions and CNOT gate error rates in noisy intermediate-scale quantum (NISQ) hardware. Our contribution is twofold. First, we define a cost function, \Cost, by approximating the average gate fidelity Favg. According to the simulation results, \Cost fits the error probability of a noisy CNOT circuit, Prob = 1 - Favg, much tighter than the commonly used cost functions. On IBM's fake Nairobi backend, it fits Prob with an error at most 10^(-3). On other backends, it fits Prob with an error at most 10^(-1). Moreover, it circumvents the computation complexity of calculating Favg and shows remarkable scalability.<br><br>Second, we propose an architecture-aware CNOT synthesis algorithm, NAPermRowCol, by adapting the leading Steiner-tree-based synthesis algorithms. A weighted edge is used to encode a CNOT gate error rate and \Cost-instructed heuristics are applied to each reduction step. NAPermRowCol is benchmarked against the state-of-the-art CNOT synthesis algorithms in terms of the \Cost metric and the synthesized CNOT count. On average, for all input CNOT circuits with no more than 16 qubits, it is 2 times cheaper than Qiskit and it reduces the synthesized gate count by 20 times. Compared with algorithms that are noise-agnostic, it is effective and scalable to improve the fidelity of CNOT circuits. Depending on the benchmark circuit and the IBM backend selected, it lowers the synthesized CNOT count up to 58.71% compared to ROWCOL and up to 17.25% compared to PermRowCol. Moreover, it reduces the \Cost of a synthesized CNOT circuit, up to 56.92% compared to ROWCOL and up to 21.6% compared to PermRowCol.<br><br>Using the \Cost metric, NAPermRowCol improves the fidelity and execution time of a synthesized CNOT circuit across varied NISQ hardware. It does not use ancillary qubits and it is not restricted to certain initial qubit maps. It could be generalized to route a more complicated quantum circuit, and thus boost the overall efficiency and accuracy of quantum computing on NISQ devices. <br><br>Joint-work with: Dohun Kim, Minyoung Kim, and Michele Mosca
UID:1776761654addeventcom
SUMMARY:Improving the Fidelity of CNOT Circuits on NISQ Hardware
DTSTART;TZID=America/New_York:20240320T120000
DTEND;TZID=America/New_York:20240320T130000
DTSTAMP:20260421T085414Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:QNC 1201
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
BEGIN:VALARM
TRIGGER:-PT30M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR